相关论文: Implementing Shor's algorithm on Josephson Charge …
An alternative quantum algorithm for the discrete logarithm problem is presented. The algorithm uses two quantum registers and two Fourier transforms whereas Shor's algorithm requires three registers and four Fourier transforms. A crucial…
In order to achieve speedup over conventional classical computing for finding solution of computationally hard problems, quantum computing was introduced. Quantum algorithms can be simulated in a pseudo quantum environment, but…
Josephson junctions have demonstrated enormous potential as qubits for scalable quantum computing architectures. Here we discuss the current approaches for making multi-qubit circuits and performing quantum information processing with them.
We perform formal verification of quantum circuits by integrating several techniques specialized to particular classes of circuits. Our verification methodology is based on the new notion of a reversible miter that allows one to leverage…
Shor's quantum algorithm for discrete logarithms applied to elliptic curve groups forms the basis of a "quantum attack" of elliptic curve cryptosystems. To implement this algorithm on a quantum computer requires the efficient implementation…
We show in some detail how to implement Shor's efficient quantum algorithm for discrete logarithms for the particular case of elliptic curve groups. It turns out that for this problem a smaller quantum computer can solve problems further…
The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be…
Frequently, subroutines in quantum computers have the structure $\mathcal{F}\mathcal{U}\mathcal{F}^{-1}$, where $\mathcal{F}$ is some unitary transform and $\mathcal{U}$ is performing a quantum computation. In this paper we suggest that if,…
Entanglement has been termed a critical resource for quantum information processing and is thought to be the reason that certain quantum algorithms, such as Shor's factoring algorithm, can achieve exponentially better performance than their…
A foundational assumption of quantum error correction theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Two major challenges that could become fundamental roadblocks…
Quantum optimal control theory allows to design accurate quantum gates. We employ it to design high-fidelity two-bit gates for Josephson charge qubits in the presence of both leakage and noise. Our protocol considerably increases the…
We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Exact Cover problem as well as the Grover's problem. The…
We provide two improvements to Regev's recent quantum factoring algorithm (Journal of the ACM 2025), addressing its space efficiency and its noise-tolerance. Our first contribution is to improve the quantum space efficiency of Regev's…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
In the paper, we consider quantum circuits for Quantum fingerprinting (quantum hashing) and quantum Fourier transform (QFT) algorithms. Quantum fingerprinting (quantum hashing) is a well-known technique for comparing large objects using…
A scheme for the generation of the cluster states based on the Josephson charge qubit is proposed. The two-qubit generating case is first introduced, and then generalized to multi-qubit case. The scheme is simple and easily manipulated,…
Quantum computers could perform certain tasks which no classical computer can perform in acceptable times. Josephson junction circuits can serve as building blocks of quantum computers. We discuss and compare two designs, which employ…
Photonics has been a promising platform for implementing quantum technologies owing to its scalability and robustness. In this Letter, we demonstrate the encoding of information in 32 time bins or dimensions of a single photon. A practical…
We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of $^{13}$C-labeled CHFBr$_2$, in which the three weakly coupled spin-1/2…