Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Disentangling Hype from Practicality: On Realistically Achieving Quantum Advantage (2307.00523v1)

Published 2 Jul 2023 in quant-ph, cs.DS, cs.PF, and physics.pop-ph

Abstract: Quantum computers offer a new paradigm of computing with the potential to vastly outperform any imagineable classical computer. This has caused a gold rush towards new quantum algorithms and hardware. In light of the growing expectations and hype surrounding quantum computing we ask the question which are the promising applications to realize quantum advantage. We argue that small data problems and quantum algorithms with super-quadratic speedups are essential to make quantum computers useful in practice. With these guidelines one can separate promising applications for quantum computing from those where classical solutions should be pursued. While most of the proposed quantum algorithms and applications do not achieve the necessary speedups to be considered practical, we already see a huge potential in material science and chemistry. We expect further applications to be developed based on our guidelines.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (16)
  1. Degree vs. approximate degree and quantum implications of huang’s sensitivity theorem. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, page 1330–1342, New York, NY, USA, 2021. Association for Computing Machinery.
  2. Quantum supremacy using a programmable superconducting processor. Nature, 574:505–510, 2019.
  3. Focus beyond quadratic speedups for error-corrected quantum advantage. PRX Quantum, 2:010103, Mar 2021.
  4. Assessing requirements to scale to practical quantum advantage, 2022.
  5. NVIDIA Corporation. NVIDIA A100 Tensor Core GPU Architecture, 2020. https://www.nvidia.com/content/dam/en-zz/Solutions/Data-Center/nvidia-ampere-architecture-whitepaper.pdf.
  6. Richard P Feynman. Simulating physics with computers, 1981. International Journal of Theoretical Physics, 21(6/7), 1981.
  7. Craig Gidney. Halving the cost of quantum addition. Quantum, 2:74, June 2018.
  8. Efficient magic state factories with a catalyzed |C⁢C⁢Z⟩ket𝐶𝐶𝑍|CCZ\rangle| italic_C italic_C italic_Z ⟩ to 2⁢|T⟩2ket𝑇2|T\rangle2 | italic_T ⟩ transformation. Quantum, 3:135, April 2019.
  9. Architectures for a quantum random access memory. Physical Review A, 78(5), nov 2008.
  10. Quantum random access memory. Physical Review Letters, 100(16), apr 2008.
  11. L K Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2), 7 1997.
  12. Lov K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’96, page 212–219, New York, NY, USA, 1996. Association for Computing Machinery.
  13. Quantum algorithm for linear systems of equations. Phys. Rev. Lett., 103:150502, Oct 2009.
  14. Scott Jones. GlobalFoundries: 7nm, 5nm and 3nm Logic, current and projected processes, 2018. https://semiwiki.com/semiconductor-manufacturers/intel/7544-7nm-5nm-and-3nm-logic-current-and-projected-processes/.
  15. Fpnew: An open-source multiformat floating-point unit architecture for energy-proportional transprecision computing. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 29(4):774–787, 2021.
  16. Peter W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26(5):1484–1509, oct 1997.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Torsten Hoefler (203 papers)
  2. Thomas Haener (1 paper)
  3. Matthias Troyer (147 papers)
Citations (69)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com