Related papers: Computing prime factors with a Josephson phase qub…
Properties of Shor's algorithm and the related period-finding algorithm could serve as benchmarks for the operation of a quantum computer. Distinctive universal behaviour is expected for the probability for success of the period-finding…
Quantum-Kit is a graphical desktop application for quantum circuit simulations. Its powerful, memory-efficient computational engine enables large-scale simulations on a desktop. The ability to design hybrid circuits, with both quantum and…
We report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous…
Shor's algorithm has seriously challenged information security based on public key cryptosystems. However, to break the widely used RSA-2048 scheme, one needs millions of physical qubits, which is far beyond current technical capabilities.…
We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function and then transforming the k-bit coupling ($k\geq 3$) terms to quadratic terms…
A quantum computer can solve hard problems - such as prime factoring, database searching, and quantum simulation - at the cost of needing to protect fragile quantum states from error. Quantum error correction provides this protection, by…
We consider a version of Shor's quantum factoring algorithm such that the quantum Fourier transform is replaced by an extremely simple one where decomposition coefficients take only the values of $1,i,-1,-i$. In numerous calculations which…
We introduce a method for finding the required control parameters for a quantum computer that yields the desired quantum algorithm without invoking elementary gates. We concentrate on the Josephson charge-qubit model, but the scenario is…
We formulate and numerically simulate the single control qubit Shor algorithm for the case of static imperfections induced by residual couplings between qubits. This allows us to study the accuracy of Shor's algorithm with respect to these…
This paper presents a computer program, written in Maple, that allows a user to simulate certain aspects of Shor's quantum factoring algorithm on a desktop or laptop computer. The program does not simulate the unitary operations carried out…
These are pedagogical notes on Shor's factoring algorithm, which is a quantum algorithm for factoring very large numbers (of order of hundreds to thousands of bits) in polynomial time. In contrast, all known classical algorithms for the…
Quantum processing units (QPUs) based on superconducting Josephson junctions promise significant advances in quantum computing. However, they face critical challenges. Decoherence, scalability limitations, and error correction overhead…
Quantum processors are potentially superior to their classical counterparts for many computational tasks including factorization. Circuit methods as well as adiabatic methods have already been proposed and implemented for finding the…
Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and discrete logarithms, which is of both fundamental importance…
Superconducting circuits with Josephson junctions distinguish themselves from other types of quantum computing architectures by having easily controllable metastable computational states (the so-called phase qubits) with a very large ratio…
We study the implementation of quantum phase measurement in a superconducting circuit, where two Josephson phase qubits are coupled to the photon field inside a resonator. We show that the relative phase of the superposition of two Fock…
In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of…
Quantum algorithms are at the heart of the ongoing efforts to use quantum mechanics to solve computational problems unsolvable on ordinary classical computers. Their common feature is the use of genuine quantum properties such as…
We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer $N-1$ primality test using Shor's algorithm. O($\log^3 N \log\log N \log\log\log N$) elementary q-bit operations are required to determine the…
Quantum logic gates must perform properly when operating on their standard input basis states, as well as when operating on complex superpositions of these states. Experiments using superconducting qubits have validated the truth table for…