• Corpus ID: 221095726

Offloading Quantum Computation by Superposition Masking

  title={Offloading Quantum Computation by Superposition Masking},
  author={Samuel Jaques and Craig Gidney},
  journal={arXiv: Quantum Physics},
Error correction will add so much overhead to large quantum computations that we suspect the most efficient algorithms will use a classical co-processor to do as much work as possible. We present a method to offload portions of a quantum computation to a classical computer by producing a superposition of masks which hide a quantum input. With the masks, we can measure the result without altering the original input and then perform classical computations on the measured output. If the task has… 


Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.
Improved quantum circuits for elliptic curve discrete logarithms
A full implementation of point addition in the Q# quantum programming language that allows unit tests and automatic quantum resource estimation for all components and presents various trade-offs between different cost metrics including the number of qubits, circuit depth and $T$-gate count.
On the need for large Quantum depth
The results show that relative to oracles, doubling the quantum circuit depth indeed gives the hybrid model more power, and this cannot be traded by classical computation.
Taming the Instruction Bandwidth of Quantum Computers via Hardware-Managed Error Correction
It is shown that 99.999% of the instructions in the instruction stream of a typical quantum workload stem from error correction, and an architecture that delegates the task of quantum error correction to the hardware is proposed, QuEST (Quantum Error-Correction Substrate), which reduces instruction bandwidth demand of several key workloads by ftve orders of magnitude.
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,
Shor's discrete logarithm quantum algorithm for elliptic curves
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
An introduction to measurement based quantum computation
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
The results indicate that, for current parameters at comparable classical security levels, the number of qubits required to tackle elliptic curves is less than for attacking RSA, suggesting that indeed ECC is an easier target than RSA.
Quantum cryptanalysis of symmetric, public-key and hash-based cryptographic schemes
For many of the currently used asymmetric (public-key) cryptographic schemes based on RSA and elliptic curve discrete logarithms, cost estimates are provided based on the latest advances in cryptanalysis, circuit compilation and quantum fault-tolerance theory.
QuRE: The Quantum Resource Estimator toolbox
The tradeoff between concatenated and surface error correction coding techniques is investigated, demonstrating the existence of a crossover point for the Ground State Estimation Algorithm.