Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Why We Should Be Skeptical of Quantum Computing

Alan M. Kadin

Published Nov 17, 2021• 0 citations
Publisher

Abstract

It is widely believed that quantum computing is on the threshold of practicality, with performance that will soon greatly surpass that of classical computing. On the contrary, I argue that quantum computing does not currently exist, and probably never will. First, although quantum annealing systems have been demonstrated to solve practical optimization problems, they are actually performing classical analog annealing, with no quantum enhancement. In contrast, while systems of quantum gate arrays, which are expected to perform digital quantum computing, have been fabricated with up to ~ 100 qubits in several technologies, they have not performed any practical computations. This is not merely a question of excess noise; the theory of massive quantum entanglement, necessary for the desired performance, has never been actually been verified. The well-established quantum results such as electronic energy bands do not incorporate quantum entanglement. I suggest that the experimental observations in multi-qubit systems may be explained as the result of delocalized coupled oscillator modes, similar to that in electronic energy bands. Such coupled modes would not yield the exponential increase in degrees of freedom needed for quantum speedup, and hence would not be useful for computing. Tests on these multi-qubit systems should be able to distinguish these two models. The quantum computing research community really needs to address this issue.

DOI
10.36227/techrxiv.17003635

Related papers

Proposed Experiments to Test the Foundations of Quantum Computing

Alan M. Kadin, Steven B. Kaplan

Quantum computing promises computational performance that is exponentially faster than any conceivable classical computer. This is due to the theoretically expected scaling of N entangled qubits, with parallel evolution of 2^N quantum states. This is in sharp contrast to classical computing, where N bits may have 2^N classical states, but only one at a time. It is widely believed that quantum superposition and entanglement have been demonstrated in several experimental systems, and that practical quantum computing can be achieved once sufficiently long quantum relaxation times are obtained. On the contrary, we suggest that there may be serious problems with quantum computing on both the macroscopic and microscopic levels, and that the experiments thus far have not proven the existence of non-classical superposition states, which are necessary for the proper functioning of qubits. In order to investigate this further, we propose new experiments in three physical systems: electron spins, single photons, and superconducting loops. We further suggest that certain more limited classes of quantum computing, such as quantum annealing, do not require quantum entanglement, and can achieve significant performance enhancements even if universal quantum computing proves to be impossible.

•Jul 1, 2016•1 citation

Quantum Computers: Myths and Reality

Andrei Yu. Khrennikov

Quantum computing is widely promoted as a transformative technology with the potential to revolutionize fields as diverse as artificial intelligence, finance, optimization, and materials science. Yet the public narrative surrounding quantum computing often diverges sharply from the technical realities acknowledged by specialists. This paper examines the roots of this discrepancy by distinguishing the genuine scientific achievements of quantum information theory from the speculative expectations projected onto quantum hardware. After outlining the central practical challenges posed by noise, decoherence, and the extreme overhead of quantum error correction, we argue that the path to large-scale, general-purpose quantum computers remains uncertain and potentially infeasible. Drawing a historical parallel with the nuclear fusion project, we illustrate how a theoretically elegant idea may confront fundamental obstacles in physical implementation. We further analyze the sources of technological hype in both scientific and popular discourse and highlight more realistic avenues for progress, such as quantum simulation and quantum-inspired classical computation. Finally, we revisit the conceptual foundations of quantum computational advantage and emphasize that constructive probability interference - rather than superposition or entanglement alone - may provide the true insight into quantum speedups. The goal of this note is not to diminish the value of quantum information research but to restore balance between promise and feasibility, clarifying what quantum computers can and cannot achieve in practice.

•Nov 28, 2025•0 citations

What Limits the Simulation of Quantum Computers?

Yiqing Zhou, E. Miles Stoudenmire, Xavier Waintal

An ultimate goal of quantum computing is to perform calculations beyond the reach of any classical computer.It is therefore imperative that useful quantum computers be very difficult to simulate classically, otherwise classical computers could be used for the applications envisioned for the quantum ones.Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits N or the depth D of the circuit.This difficulty has triggered recent experiments on deep, random circuits that aim to demonstrate that quantum devices may already perform tasks beyond the reach of classical computing.These real quantum computing devices, however, suffer from many sources of decoherence and imprecision which limit the degree of entanglement that can actually be reached to a fraction of its theoretical maximum.They are characterized by an exponentially decaying fidelity F ∼ ð1 -ϵÞ ND with an error rate ϵ per operation as small as ≈1% for current devices with several dozen qubits or even smaller for smaller devices.In this work, we provide new insight on the computing capabilities of real quantum computers by demonstrating that they can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer.Our algorithms compress the representations of quantum wave functions using matrix product states, which are able to capture states with low to moderate entanglement very accurately.This compression introduces a finite error rate ϵ so that the algorithms closely mimic the behavior of real quantum computing devices.The computing time of our algorithm increases only linearly with N and D in sharp contrast with exact simulation algorithms.We illustrate our algorithms with simulations of random circuits for qubits connected in both one-and twodimensional lattices.We find that ϵ can be decreased at a polynomial cost in computing power down to a minimum error ϵ ∞ .Getting below ϵ ∞ requires computing resources that increase exponentially with ϵ ∞ =ϵ.For a two-dimensional array of N ¼ 54 qubits and a circuit with control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours.For more complex gates such as a SWAP gate followed by a controlled rotation, the error rate increases by a factor 3 for similar computing time.Our results suggest that, despite the high fidelity reached by quantum devices, only a tiny fraction ð∼10 -8 Þ of the system Hilbert space is actually being exploited.

arXiv:2002.07730•Physical Review X•Nov 23, 2020•301 citations

Do we need quantum for quantum computing?

David K. Ferry, Richard Akis, Matthew J. Gilbert +1 more

The concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. There also has been considerable discussion about physical implementations of the qubit. This has led, in recent years, to a situation in which quantum computing and quantum information theory are being rapidly developed. In general, the specific advantages offered by quantum computing have been somewhat nebulous. On the one hand, faster computing was promised, but we now know that no speedup of most algorithms exists relative the speed that can be obtained with massive parallel processing. Then, we are promised that the use of entanglement will make quantum computing possible with a much smaller use of resources. Yet, entanglement must be viewed as a hidden variable, which is not accessible in experiment. How does this provide the speedup? We have suggested that analog processing may provide a suitable alternative, and may be the basis which provides the speedup in quantum computing, but this is a controversial assertion. In this talk, we will discuss these particular viewpoints, along with several approaches to a wave basis for (quantum) computing.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 9, 2003•6 citations

Unraveling Quantum Annealers using Classical Hardness

Víctor Martín-Mayor, Itay Hen

Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, commonly referred to as 'D-Wave' chips, promise to solve practical optimization problems potentially faster than conventional 'classical' computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of experimental quantum annealers from their classical thermal counterparts. Inspired by recent results in spin-glass theory that recognize 'temperature chaos' as the underlying mechanism responsible for the computational intractability of hard optimization problems, we devise a general method to quantify the performance of quantum annealers on optimization problems suffering from varying degrees of temperature chaos: A superior performance of quantum annealers over classical algorithms on these may allude to the role that quantum effects play in providing speedup. We utilize our method to experimentally study the D-Wave Two chip on different temperature-chaotic problems and find, surprisingly, that its performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss several purely classical effects that possibly mask the quantum behavior of the chip.

arXiv:1502.02494•Scientific Reports•Oct 20, 2015•75 citations

Classical and quantum optimization of quantum processors

Tim Menke

Quantum interactions are strikingly different from their classical counterparts, and they lead to counter-intuitive effects such as quantum entanglement. The advances in quantum science and technology over the past two decades have shown that such interactions can be harnessed in quantum devices to address hard computational problems. The field of quantum computation has emerged, and superconducting circuits have become a leading platform for quantum processors. Because of the large design space and the difficulty to simulate design prototypes on a classical computer, a key challenge in quantum processor engineering is to translate desired quantum characteristics into a circuit design. A particular obstacle has been the implementation of interactions between multiple quantum bits (qubits) in one coupling mechanism. Multi-qubit interactions are necessary for a number of applications in quantum annealing, analog quantum simulation, and digital quantum computation. In this work, we develop classical and quantum computational methods to address the challenge of implementing such interactions. We present a computational method for automated design of superconducting circuits. Our method performs a parallelized, closed-loop optimization to design superconducting circuit diagrams that match predefined properties, such as dispersion features and noise sensitivities. We employ it to design a coupler for superconducting flux qubits that mediates 4-qubit interactions. The coupler circuit is then realized experimentally. We find that it has the desired ground state dispersion properties versus flux and that it does not adversely affect the lifetime of a connected flux qubit. Moreover, the coupling concept can be extended by systematically adding loops to the coupler. In a second iteration, we implement a circuit architecture in which the coupler mediates interactions between three flux qubits. The system Hamiltonian is estimated via multi-qubit pulse sequences that implement Ramsey-type interferometry between all neighboring excitation manifolds. We verify that the multi-qubit system exhibits a 3-qubit coupling that is coherently tunable, which is important for practical applications. Finally, we address the challenge that complex multi-qubit circuits are difficult to simulate accurately on a classical computer as they become larger. As a solution, we propose quantum algorithms to design and test the performance of next-generation quantum hardware on a quantum computer. We have therefore addressed the challenge of quantum device design both from a classical optimization and from a quantum computational angle.

•Jan 1, 2022•0 citations
It is widely believed that quantum computing is on the threshold of practicality, with performance that will soon greatly surpass that of classical computing. On the contrary, I argue that quantum computing does not currently exist, and probably never will. First, although quantum annealing systems have been demonstrated to solve practical optimization problems, they are actually performing classical analog annealing, with no quantum enhancement. In contrast, while systems of quantum gate arrays, which are expected to perform digital quantum computing, have been fabricated with up to ~ 100 qubits in several technologies, they have not performed any practical computations. This is not merely a question of excess noise; the theory of massive quantum entanglement, necessary for the desired performance, has never been actually been verified. The well-established quantum results such as electronic energy bands do not incorporate quantum entanglement. I suggest that the experimental observations in multi-qubit systems may be explained as the result of delocalized coupled oscillator modes, similar to that in electronic energy bands. Such coupled modes would not yield the exponential increase in degrees of freedom needed for quantum speedup, and hence would not be useful for computing. Tests on these multi-qubit systems should be able to distinguish these two models. The quantum computing research community really needs to address this issue.
Quantum computing promises computational performance that is exponentially faster than any conceivable classical computer. This is due to the theoretically expected scaling of N entangled qubits, with parallel evolution of 2^N quantum states. This is in sharp contrast to classical computing, where N bits may have 2^N classical states, but only one at a time. It is widely believed that quantum superposition and entanglement have been demonstrated in several experimental systems, and that practical quantum computing can be achieved once sufficiently long quantum relaxation times are obtained. On the contrary, we suggest that there may be serious problems with quantum computing on both the macroscopic and microscopic levels, and that the experiments thus far have not proven the existence of non-classical superposition states, which are necessary for the proper functioning of qubits. In order to investigate this further, we propose new experiments in three physical systems: electron spins, single photons, and superconducting loops. We further suggest that certain more limited classes of quantum computing, such as quantum annealing, do not require quantum entanglement, and can achieve significant performance enhancements even if universal quantum computing proves to be impossible.
Quantum computing is widely promoted as a transformative technology with the potential to revolutionize fields as diverse as artificial intelligence, finance, optimization, and materials science. Yet the public narrative surrounding quantum computing often diverges sharply from the technical realities acknowledged by specialists. This paper examines the roots of this discrepancy by distinguishing the genuine scientific achievements of quantum information theory from the speculative expectations projected onto quantum hardware. After outlining the central practical challenges posed by noise, decoherence, and the extreme overhead of quantum error correction, we argue that the path to large-scale, general-purpose quantum computers remains uncertain and potentially infeasible. Drawing a historical parallel with the nuclear fusion project, we illustrate how a theoretically elegant idea may confront fundamental obstacles in physical implementation. We further analyze the sources of technological hype in both scientific and popular discourse and highlight more realistic avenues for progress, such as quantum simulation and quantum-inspired classical computation. Finally, we revisit the conceptual foundations of quantum computational advantage and emphasize that constructive probability interference - rather than superposition or entanglement alone - may provide the true insight into quantum speedups. The goal of this note is not to diminish the value of quantum information research but to restore balance between promise and feasibility, clarifying what quantum computers can and cannot achieve in practice.
An ultimate goal of quantum computing is to perform calculations beyond the reach of any classical computer.It is therefore imperative that useful quantum computers be very difficult to simulate classically, otherwise classical computers could be used for the applications envisioned for the quantum ones.Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits N or the depth D of the circuit.This difficulty has triggered recent experiments on deep, random circuits that aim to demonstrate that quantum devices may already perform tasks beyond the reach of classical computing.These real quantum computing devices, however, suffer from many sources of decoherence and imprecision which limit the degree of entanglement that can actually be reached to a fraction of its theoretical maximum.They are characterized by an exponentially decaying fidelity F ∼ ð1 -ϵÞ ND with an error rate ϵ per operation as small as ≈1% for current devices with several dozen qubits or even smaller for smaller devices.In this work, we provide new insight on the computing capabilities of real quantum computers by demonstrating that they can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer.Our algorithms compress the representations of quantum wave functions using matrix product states, which are able to capture states with low to moderate entanglement very accurately.This compression introduces a finite error rate ϵ so that the algorithms closely mimic the behavior of real quantum computing devices.The computing time of our algorithm increases only linearly with N and D in sharp contrast with exact simulation algorithms.We illustrate our algorithms with simulations of random circuits for qubits connected in both one-and twodimensional lattices.We find that ϵ can be decreased at a polynomial cost in computing power down to a minimum error ϵ ∞ .Getting below ϵ ∞ requires computing resources that increase exponentially with ϵ ∞ =ϵ.For a two-dimensional array of N ¼ 54 qubits and a circuit with control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours.For more complex gates such as a SWAP gate followed by a controlled rotation, the error rate increases by a factor 3 for similar computing time.Our results suggest that, despite the high fidelity reached by quantum devices, only a tiny fraction ð∼10 -8 Þ of the system Hilbert space is actually being exploited.
The concept of quantum computing has arisen as a methodology by which very rapid computations can be achieved. There also has been considerable discussion about physical implementations of the qubit. This has led, in recent years, to a situation in which quantum computing and quantum information theory are being rapidly developed. In general, the specific advantages offered by quantum computing have been somewhat nebulous. On the one hand, faster computing was promised, but we now know that no speedup of most algorithms exists relative the speed that can be obtained with massive parallel processing. Then, we are promised that the use of entanglement will make quantum computing possible with a much smaller use of resources. Yet, entanglement must be viewed as a hidden variable, which is not accessible in experiment. How does this provide the speedup? We have suggested that analog processing may provide a suitable alternative, and may be the basis which provides the speedup in quantum computing, but this is a controversial assertion. In this talk, we will discuss these particular viewpoints, along with several approaches to a wave basis for (quantum) computing.
Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealing optimizers that contain hundreds of quantum bits. These optimizers, commonly referred to as 'D-Wave' chips, promise to solve practical optimization problems potentially faster than conventional 'classical' computers. Attempts to quantify the quantum nature of these chips have been met with both excitement and skepticism but have also brought up numerous fundamental questions pertaining to the distinguishability of experimental quantum annealers from their classical thermal counterparts. Inspired by recent results in spin-glass theory that recognize 'temperature chaos' as the underlying mechanism responsible for the computational intractability of hard optimization problems, we devise a general method to quantify the performance of quantum annealers on optimization problems suffering from varying degrees of temperature chaos: A superior performance of quantum annealers over classical algorithms on these may allude to the role that quantum effects play in providing speedup. We utilize our method to experimentally study the D-Wave Two chip on different temperature-chaotic problems and find, surprisingly, that its performance scales unfavorably as compared to several analogous classical algorithms. We detect, quantify and discuss several purely classical effects that possibly mask the quantum behavior of the chip.
Quantum interactions are strikingly different from their classical counterparts, and they lead to counter-intuitive effects such as quantum entanglement. The advances in quantum science and technology over the past two decades have shown that such interactions can be harnessed in quantum devices to address hard computational problems. The field of quantum computation has emerged, and superconducting circuits have become a leading platform for quantum processors. Because of the large design space and the difficulty to simulate design prototypes on a classical computer, a key challenge in quantum processor engineering is to translate desired quantum characteristics into a circuit design. A particular obstacle has been the implementation of interactions between multiple quantum bits (qubits) in one coupling mechanism. Multi-qubit interactions are necessary for a number of applications in quantum annealing, analog quantum simulation, and digital quantum computation. In this work, we develop classical and quantum computational methods to address the challenge of implementing such interactions. We present a computational method for automated design of superconducting circuits. Our method performs a parallelized, closed-loop optimization to design superconducting circuit diagrams that match predefined properties, such as dispersion features and noise sensitivities. We employ it to design a coupler for superconducting flux qubits that mediates 4-qubit interactions. The coupler circuit is then realized experimentally. We find that it has the desired ground state dispersion properties versus flux and that it does not adversely affect the lifetime of a connected flux qubit. Moreover, the coupling concept can be extended by systematically adding loops to the coupler. In a second iteration, we implement a circuit architecture in which the coupler mediates interactions between three flux qubits. The system Hamiltonian is estimated via multi-qubit pulse sequences that implement Ramsey-type interferometry between all neighboring excitation manifolds. We verify that the multi-qubit system exhibits a 3-qubit coupling that is coherently tunable, which is important for practical applications. Finally, we address the challenge that complex multi-qubit circuits are difficult to simulate accurately on a classical computer as they become larger. As a solution, we propose quantum algorithms to design and test the performance of next-generation quantum hardware on a quantum computer. We have therefore addressed the challenge of quantum device design both from a classical optimization and from a quantum computational angle.