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

Fluctuation and Noise Letters

Thirty Years of Quantum Computing

M. I. Dyakonov

Published Nov 27, 2024• 1 citation
Publisher

Abstract

The possibility of building a quantum computer is critically analyzed. The main point is that the general state of the hypothetical quantum computer with N qubits is characterized by 2N quantum amplitudes, which are complex numbers restricted by the normalization condition only. It looks highly improbable that it will ever be possible to keep under our control this number of complex parameters even for modest values of [Formula: see text] 50 or 100.

DOI
10.1142/s0219477524400650

Related papers

Will We Ever Have a Quantum Computer?

M. I. Dyakonov

In the hypothetical quantum computing one replaces the classical twostate bit by a quantum element (qubit) with two basic states, ↑ and ↓.Its arbitrary state is described by the wave function ψ = a↑+ b↓, where a and b are complex amplitudes, satisfying the normalization condition.Unlike the classical bit, that can be only in one of the two states, ↑ or ↓, the qubit can be in a continuum of states defined by the quantum amplitudes a and b.The qubit is a continuous object.At a given moment, the state of a quantum computer with N qubits is characterized by 2 N quantum amplitudes, which are continuous variables restricted by the normalization condition only.Thus, the hypothetical quantum computer is an analog machine characterized by a super-astronomical number of continuous variables (even for N~100÷1000).Their values cannot be arbitrary, they must be under our control.Thus the answer to the question in title is: When physicists and engineers will learn to keep under control this number of continuous parameters, which means -never.

Advances in parallel computing•Jan 1, 2020•1 citation

Prospects for quantum computing: Extremely doubtful

M. I. Dyakonov

The quantum computer is supposed to process information by applying unitary transformations to 2 N complex amplitudes defining the state of N qubits. A useful machine needing N~10 3 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is at least 2 1000 ~10 300 which is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proved via the “threshold theorem”. Like for any theorem, the proof is based on a number of assumptions considered as axioms. However, in the physical world none of these assumptions can be fulfilled exactly. Any assumption can be only approached with some limited precision. So, the rather meaningless “error per qubit per gate” threshold must be supplemented by a list of the precisions with which all assumptions behind the threshold theorem should hold. Such a list still does not exist. The theory also seems to ignore the undesired free evolution of the quantum computer caused by the energy differences of quantum states entering any given superposition. Another important point is that the hypothetical quantum computer will be a system of 10 3 –10 6 qubits PLUS an extremely complex and monstrously sophisticated classical apparatus. This huge and strongly nonlinear system will generally exhibit instabilities and chaotic behavior.

arXiv:1401.3629•International Journal of Modern Physics Conference Series•Jan 1, 2014•11 citations

Building a quantum computer (invited)

Barry C. Sanders

Quantum computing has leapt from concept to commercial enterprise in four decades and now the complexities of computer hardware apply to quantum computing but with the added challenge that computer fundamentals are radically different.

•Nov 5, 2020•3 citations

A quantum random access memory (QRAM) using a polynomial encoding of binary strings

Priyanka Mukhopadhyay

Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages in practice. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly in most error correction schemes. Integral to our design is a polynomial encoding of bit strings and so we refer to this design as [Formula: see text]. Compared to the previous state-of-the-art bucket brigade architecture for QRAM, we achieve an exponential improvement in T-depth, while reducing T-count and keeping the qubit-count same. Specifically, if N is the number of memory locations to be queried, then [Formula: see text] has T-depth [Formula: see text], T-count [Formula: see text] and uses O(N) logical qubits, while the bucket brigade circuit has T-depth [Formula: see text], T-count O(N) and uses O(N) qubits. Combining two [Formula: see text] we design a quantum look-up-table, [Formula: see text], that has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. A quantum look-up table (qLUT) or quantum read-only memory (QROM) has restricted functionality than a QRAM. For example, it cannot write into a memory location and the circuit needs to be compiled each time the contents of the memory change. The previous state-of-the-art CSWAP architecture has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. Thus we achieve a double exponential improvement in T-depth while keeping the T-count and qubit-count asymptotically same. Additionally, with our polynomial encoding of bit strings, we develop a method to optimize the Toffoli-count of circuits, specially those consisting of multi-controlled-NOT gates.

arXiv:2408.16794•Scientific Reports•Mar 31, 2025•13 citations

Thirty years of quantum computing

David Peter Divincenzo

Abstract We arrive at the centennial of modern quantum mechanics. In about the last third of that century, we have been busy connecting quantum theory with the theory of information and the theory of computing, and with trying to turn quantum phenomena into quantum technologies. We have been talking about the quantum computer for most this trimester (i.e. for the last third-century of the history of quantum physics). Where are we at with this fantastic device? Here I give a few reflections on this question.

Quantum Science and Technology•Jun 4, 2025•6 citations

Quantum Computer on Nvidia GPU

Alexander Soiguine

Geometric Algebra formalism opens the door to developing a theory deeper than conventional quantum mechanics. Generalizations, stemming from implementation of complex numbers as geometrically feasible objects in three dimensions, unambiguous definition of states, observables, measurements, Maxwell equations solution in those terms, bring into reality a kind of physical fields spreading through the whole three-dimensional space and values of the time parameter. The fields can be modified instantly in all points of space and time values, thus eliminating the concept of cause and effect, and perceiving of one-directional time. In the suggested theory all measured observable values get available all together, not through looking one by one. In this way quantum computer appeared to be a kind of analog computer keeping and instantly processing information by and on sets of objects possessing an infinite number of degrees of freedom. As practical implementation, the multithread GPUs bearing the CUDA language functionality allow to simultaneously calculate observable measurement values at a number of space/time discrete points only restricted by the GPU threads capacity.

Journal of Applied Mathematics and Physics•Jan 1, 2023•2 citations
The possibility of building a quantum computer is critically analyzed. The main point is that the general state of the hypothetical quantum computer with N qubits is characterized by 2N quantum amplitudes, which are complex numbers restricted by the normalization condition only. It looks highly improbable that it will ever be possible to keep under our control this number of complex parameters even for modest values of [Formula: see text] 50 or 100.
In the hypothetical quantum computing one replaces the classical twostate bit by a quantum element (qubit) with two basic states, ↑ and ↓.Its arbitrary state is described by the wave function ψ = a↑+ b↓, where a and b are complex amplitudes, satisfying the normalization condition.Unlike the classical bit, that can be only in one of the two states, ↑ or ↓, the qubit can be in a continuum of states defined by the quantum amplitudes a and b.The qubit is a continuous object.At a given moment, the state of a quantum computer with N qubits is characterized by 2 N quantum amplitudes, which are continuous variables restricted by the normalization condition only.Thus, the hypothetical quantum computer is an analog machine characterized by a super-astronomical number of continuous variables (even for N~100÷1000).Their values cannot be arbitrary, they must be under our control.Thus the answer to the question in title is: When physicists and engineers will learn to keep under control this number of continuous parameters, which means -never.
The quantum computer is supposed to process information by applying unitary transformations to 2 N complex amplitudes defining the state of N qubits. A useful machine needing N~10 3 or more, the number of continuous parameters describing the state of a quantum computer at any given moment is at least 2 1000 ~10 300 which is much greater than the number of protons in the Universe. However, the theorists believe that the feasibility of large-scale quantum computing has been proved via the “threshold theorem”. Like for any theorem, the proof is based on a number of assumptions considered as axioms. However, in the physical world none of these assumptions can be fulfilled exactly. Any assumption can be only approached with some limited precision. So, the rather meaningless “error per qubit per gate” threshold must be supplemented by a list of the precisions with which all assumptions behind the threshold theorem should hold. Such a list still does not exist. The theory also seems to ignore the undesired free evolution of the quantum computer caused by the energy differences of quantum states entering any given superposition. Another important point is that the hypothetical quantum computer will be a system of 10 3 –10 6 qubits PLUS an extremely complex and monstrously sophisticated classical apparatus. This huge and strongly nonlinear system will generally exhibit instabilities and chaotic behavior.
Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages in practice. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly in most error correction schemes. Integral to our design is a polynomial encoding of bit strings and so we refer to this design as [Formula: see text]. Compared to the previous state-of-the-art bucket brigade architecture for QRAM, we achieve an exponential improvement in T-depth, while reducing T-count and keeping the qubit-count same. Specifically, if N is the number of memory locations to be queried, then [Formula: see text] has T-depth [Formula: see text], T-count [Formula: see text] and uses O(N) logical qubits, while the bucket brigade circuit has T-depth [Formula: see text], T-count O(N) and uses O(N) qubits. Combining two [Formula: see text] we design a quantum look-up-table, [Formula: see text], that has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. A quantum look-up table (qLUT) or quantum read-only memory (QROM) has restricted functionality than a QRAM. For example, it cannot write into a memory location and the circuit needs to be compiled each time the contents of the memory change. The previous state-of-the-art CSWAP architecture has T-depth [Formula: see text], T-count [Formula: see text] and qubit count [Formula: see text]. Thus we achieve a double exponential improvement in T-depth while keeping the T-count and qubit-count asymptotically same. Additionally, with our polynomial encoding of bit strings, we develop a method to optimize the Toffoli-count of circuits, specially those consisting of multi-controlled-NOT gates.
Abstract We arrive at the centennial of modern quantum mechanics. In about the last third of that century, we have been busy connecting quantum theory with the theory of information and the theory of computing, and with trying to turn quantum phenomena into quantum technologies. We have been talking about the quantum computer for most this trimester (i.e. for the last third-century of the history of quantum physics). Where are we at with this fantastic device? Here I give a few reflections on this question.
Geometric Algebra formalism opens the door to developing a theory deeper than conventional quantum mechanics. Generalizations, stemming from implementation of complex numbers as geometrically feasible objects in three dimensions, unambiguous definition of states, observables, measurements, Maxwell equations solution in those terms, bring into reality a kind of physical fields spreading through the whole three-dimensional space and values of the time parameter. The fields can be modified instantly in all points of space and time values, thus eliminating the concept of cause and effect, and perceiving of one-directional time. In the suggested theory all measured observable values get available all together, not through looking one by one. In this way quantum computer appeared to be a kind of analog computer keeping and instantly processing information by and on sets of objects possessing an infinite number of degrees of freedom. As practical implementation, the multithread GPUs bearing the CUDA language functionality allow to simultaneously calculate observable measurement values at a number of space/time discrete points only restricted by the GPU threads capacity.