This issue's SIGEST paper, from the SIAM Journal on Computing (SICOMP), takes SIAM readers into the world of quantum computing, a world with its roots in physics that still probably is better known to many physicists and theoretical computer scientists than to a good portion of SIAM readers. Quantum computation is a form of computing based upon quantum mechanics, rather than the classical physics that conventional computers utilize. The distinction between conventional and quantum computers starts to become apparent at the most basic level of bits: whereas standard computers utilize binary bits that may have either the state 0 or 1, quantum computers are based upon “qubits” (quantum binary digits) that may have the state 0, 1, or a superposition of these two states with a complex number that specifies the probability for being in each state. Mathematically, the state of a quantum computer can change through a sequence of unitary transformations to the initial state. One reason for the great interest in quantum computation is that it has been shown that quantum computers can solve some important problems, such as the factorization of very large integers (which has important implications for cryptography), far more efficiently than we currently are able to solve these problems on conventional computers. The selected paper, “Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation” by Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev, which was originally published in SICOMP in 2007, establishes an important theoretical result in the field of quantum computation. As the title indicates, it involves adiabatic quantum computation, a form of quantum computing that has attracted interest in recent years in part because it may offer promise in the effort to build effective quantum computers. Adiabatic quantum computation is distinctly different from standard quantum computation. In the standard model, computations are represented similarly to classical circuits, except that the circuits carry qubits instead of bits. In contrast, the adiabatic model is inspired by the adiabatic theorem in quantum mechanics which states that a system in its lowest energy or ground state will remain in that state if it is subjected to conditions that change sufficiently slowly. It already was known that standard quantum computers can efficiently simulate adiabatic quantum computers. The key contribution of this paper is to show the reverse: that adiabatic quantum computation can efficiently simulate standard quantum computation. In the words of the SICOMP editorial board in nominating this paper, “This is a surprising result that continues to be very influential.” It established that the two forms of quantum computation are theoretically equivalent, one implication of which is to bolster the potential practical importance of adiabatic quantum computation. The paper by Aharonov et al. is very nicely suited to SIGEST—it is important in its field, it is nicely and accessibly written, it offers a glimpse into an area of applied mathematics and computation that is of growing importance, and it touches on many areas of applied mathematics, including linear algebra, Markov chains, and optimization. We hope it will provide SIAM readers a glimpse of current theoretical research that may, some day, help lead to a brave new world of practical computation.
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates the potential power of quantum computation, as there is no known efficient classical method for solving this problem. The authors give an exposition of Shor's algorithm together with an introduction to quantum computation and complexity theory. They discuss experiments that may contribute to its practical implementation. [S0034-6861(96)00303-0]
The rapid evolution of computers in the half century since their invention has resulted in dramatically smaller and faster computers. However, from a computational point of view, all these computers look alike; for example, they are built out of simple logic gates. A fundamental thesis of computer science---the modern form of the Church--Turing thesis---asserts that this is inevitable in a deep sense. Any computer can be simulated with at most a polynomial factor slowdown by a probabilistic Turing machine. Quantum computation poses the first credible challenge to this thesis. It goes back to a suggestion by Feynman [4], who pointed out that there appears to be no efficient way of simulating a quantum mechanical system on a computer, and suggested that, perhaps, a computer based on quantum physical principles might be able to carry out the simulation efficiently. Two formal models for quantum computers---the quantum Turing machine [2] and quantum computational networks [3]---were defined by Deutsch. The first three papers in this issue describe efficient quantum algorithms for computational tasks that we do not know how to solve classically. In "Quantum Complexity Theory," Bernstein and Vazirani give the first formal evidence that quantum computers violate the modern form of the Church--Turing thesis. They show that a certain problem---the recursive Fourier sampling problem---can be solved in polynomial time on a quantum Turing machine, but relative to an oracle, requires superpolynomial time on a classical probabilistic Turing machine. Simon, in the paper "On the Power of Quantum Computation" introduces a fundamental projection technique and uses it to design an efficient quantum algorithm to determine whether a certain type of function is 2-1 or 1-1. He further shows that, relative to an oracle, this problem requires exponential time on a classical probabilistic Turing machine. In the paper "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer," Shor gives remarkable polynomial time quantum algorithms for two of the most famous problems in computer science: factoring and discrete log. Since the computational hardness of these problems is the basis of several famous cryptosystems, Shor's paper very dramatically underlines the power of quantum computers. To understand the computational power of quantum computers, it is helpful to consider a quantum mechanical system of n particles, each of which can be in one of two states, labeled
∣0⟩ and
∣1⟩. If this were a classical system, then its instantaneous state could be described by n bits. However, in quantum physics, the system is allowed to be in a linear superposition of configurations, and indeed the instantaneous state of the system is described by a unit vector in the 2n dimensional vector space, whose basis vectors correspond to all the2n classical configurations. Therefore, to describe the instantaneous state of the system, we must specify 2n complex numbers. Nature must update 2n complex numbers at each instant to evolve the system in time. This is an extraordinary amount of effort, since even for n = 200, 2n is larger than estimates of the number of elementary particles in the visible universe. Nonetheless, there are limits to the power of quantum computers. In "Strengths and Weaknesses of Quantum Computing," Bennett, Bernstein, Brassard, and Vazirani show that, relative to a random oracle, with probability 1, the class NP cannot be solved on a quantum Turing machine in time o(2n/2). This bound is tight, since recent work of Grover [5] has shown how to accept any language in NP in time O(2n/2) on a quantum Turing machine. Quantum computers are necessarily time reversible. Indeed, Bennett's work [1] on reversible computation inspired early work on quantum computation that preceded Feynman's paper [4]. The reversibility requirement makes it quite complex to implement even basic computational primitives such as looping or composition. In "Quantum Complexity Theory," Bernstein and Vazirani show how to implement quantum programming primitives and give a construction for an efficient universal quantum Turing machine. The structure of the universal quantum Turing machine is quite simple: it consists of a deterministic Turing machine with a single "quantum coin flip." In "Quantum Computability," Adleman, DeMarrais, and Huang greatly simplify this further by showing that a very simple type of coin flip is sufficient---a rotation by an angle
θ such that
sinθ=3/5. Making quantum computers robust against noise and decoherence is an important and challenging problem. In "Stabilization of Quantum Computations by Symmetrization," Barenco, Berthiaume, Deutsch, Ekert, Jozsa, and Macchiavello show how to use the quantum watchdog effect to stabilize a quantum computation against noise. Their method is based on running several copies of the quantum computer in parallel and projecting its state into the symmetric subspace at frequent intervals. They show that the quantum watchdog effect results in the suppression of errors that lie outside the symmetric subspace. Quantum computation touches upon the foundations of both computer science and quantum physics. It is not unlikely that the issues raised by quantum computation will stimulate further research into the foundations of quantum physics. I wish to express my gratitude to several people who made this special section possible. Oded Goldreich acted as editor for two of the papers in the issue and dealt with them with his characteristic efficiency and judgment. The editorial staff at SIAM, most notably Lisa Dougherty, Beth Gallagher, Deidre Wunderlich, and Sam Young, were extremely helpful, patient, and resourceful. Finally, I would like to thank a number of referees whose careful and timely reviews were critical to putting together this issue. Umesh Vazirani
When building cryptosystems, cryptographers focus on finding problems that are not believed to be solvable in polynomial-time. Some of the most popular problems they have found are the Discrete Logarithm Problem and Integer Factoring. The former is used in Diffie-Hellman Key Exachange (DHK) and El Gamal encryption, while the latter is used in RSA. El Gamal and DHK are both very popular, but RSA is more prevalent due to its efficiency.\n Nevertheless, it is plausible that in the next few decades, all three of these systems will likely be useless due to the advances made by Peter Shor in quantum computing. This paper will explain the details of how Shor’s algorithm works and how it accomplishes the above. It will also feature a redesign of the proof of Jeffrey Miller (1975) that efficiently reduces from order finding in a group of order N to factoring N. Hopefully, doing so will aid future students in their studies of quantum algorithms and Post-Quantum Cryptography.
In 1994 the mathematician Peter Shor, then working at AT&T Bell Laboratories in the US, applied quantum mechanics to an age-old problem in number theory and made a remarkable discovery. He showed that a computer that operates on and processes quantum systems could factor large integers exponentially faster than a conventional computer. This result attracted a lot of attention because the difficulty of factoring large numbers is what ensures the security of modern cryptography schemes – even the best conventional computer would take several thousand years to factor a number with more than about 150 digits. Shor's quantum factoring algorithm could, in principle, break such encryption standards – a possibility that led to an explosion of interest in quantum information science. Until then it was a field that had largely been a mere curiosity, despite notable contributions from the likes of Richard Feynman and David Deutsch.
Factoring large integers has long been a computationally difficult problem in classical computing, forming the foundation of widely used encryption methods like RSA. In 1994, Shor’s quantum algorithm introduced a revolutionary method for factoring integers exponentially faster than classical algorithms, laying the groundwork for quantum cryptography. Despite numerous attempts to enhance Shor’s algorithm over the last three decades, significant breakthroughs remained elusive until Regev’s discovery in 2023. Regev introduced a novel, multi-dimensional version of the quantum factoring algorithm, achieving a substantial improvement by reducing the required number of quantum gates to O(n^2 lo gn )(n^(3/2) logn ), compared to Shor’s originalO(n^2 lo gn )original O(n^2 logn ) gate complexity. Although Regev’s approach offers a significant speedup, it comes with increased qubit requirements and relies on an unproven number theory assumption. This paper presents an overview of Regev’s factoring algorithm, including a review of Shor’s work for context, followed by an examination of key recent developments and follow-up research. These include efforts to reduce the qubit count, improve error resilience, generalizegeneralise Regev’s algorithm to related problems, and validate the number theory assumption. This review serves as an accessible entry point for researchers interested in the rapidly evolving field of quantum computing and factoring algorithms.