Efficient networks for quantum factoring.

@article{Beckman1996EfficientNF,
  title={Efficient networks for quantum factoring.},
  author={Beckman and Chari and Devabhaktuni and Preskill},
  journal={Physical review. A, Atomic, molecular, and optical physics},
  year={1996},
  volume={54 2},
  pages={
          1034-1063
        }
}
  • BeckmanChari Preskill
  • Published 21 February 1996
  • Physics
  • Physical review. A, Atomic, molecular, and optical physics
We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory quantum bits (qubits) and the number of operations required to perform factorization, using the algorithm suggested by Shor [in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser (IEEE Computer Society, Los Alamitos, CA, 1994), p. 124]. A K-bit number can be factored in time of order K3 using a machine… 

Constant-optimized quantum circuits for modular multiplication and exponentiation

In the context of modular exponentiation, this work offers several constant-factor improvements, as well as an improvement by a constant additive term that is significant for few-qubit circuits arising in ongoing laboratory experiments with Shor's algorithm.

Demonstration of Shor's factoring algorithm for N [Formula: see text] 21 on IBM quantum processors.

This work implemented the quantum order-finding algorithm for factoring the integer 21 using only five qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm's speedup in general.

Quantum modular multiplier via binary-exponent-based recombination

A complexity analysis reveals that BER algorithm reduces the number of plain adders in the controlled modular exponentiation by an average of about 42% compared with Vedral–Barenco–Ekert algorithm, thus significantly decreasing the depth and total Toffoli gates of the quantum circuits.

Gravitational wave matched filtering by quantum Monte Carlo integration and quantum amplitude amplification

This paper proposes a new quantum algorithm for matched filtering in gravitational wave (GW) data analysis based on the previous work by Gao et al, and achieves an exponential reduction of the qubit number compared with Gao Et al.

Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N

It is shown that factoring is equivalent, in deterministic polynomial time, to counting points on a pair of twisted Elliptic curves modulo N, to construct a particular N′ that helps the factorization of N.

Trapped-ion quantum computing: Progress and challenges

The state of the field is reviewed, covering the basics of how trapped ions are used for QC and their strengths and limitations as qubits and the outlook for trapped-ion QC is explored.

Principles of quantum computation and information

Quantum computational finance: Monte Carlo pricing of financial derivatives

This work presents a quantum algorithm for the Monte Carlo pricing of financial derivatives and shows how the amplitude estimation algorithm can be applied to achieve a quadratic quantum speedup in the number of steps required to obtain an estimate for the price with high confidence.

High Performance Quantum Modular Multipliers

We present a novel set of reversible modular multipliers applicable to quantum computing, derived from three classical techniques: 1) traditional integer division, 2) Montgomery residue arithmetic,

Toward the first quantum simulation with quantum speedup

It is argued that simulating the time evolution of spin systems is a classically hard problem of practical interest that is among the easiest to address with early quantum devices, and develops optimized implementations and performs detailed resource analyses for several leading quantum algorithms for this problem.