Quantum computing sits at an important inflection point. For years, high-level algorithms for
quantum computers have shown considerable promise, and recent advances in quantum …

We significantly reduce the cost of factoring integers and computing discrete logarithms in
finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu …

Quantum chromodynamics (QCD) describes the structure of hadrons such as the proton at a
fundamental level. The precision of calculations in QCD limits the precision of the values of …

In a large-scale quantum computer, the cost of communications will dominate the
performance and resource requirements, place many severe demands on the technology …

Quantum computers can (in theory) solve certain problems far faster than a classical
computer running any known classical algorithm. While existing technologies for building …

The yield of physical qubits fabricated in the laboratory is much lower than that of classical
transistors in production semiconductor fabrication. Actual implementations of quantum …

Quantum computing (QC) offers huge promise to accelerate a range of computationally
intensive benchmarks. Quantum computing is limited, however, by the challenges of …

The optimal design of a fault-tolerant quantum computer involves finding an appropriate
balance between the burden of large-scale integration of noisy components and the load of …

We contribute a 2D nearest-neighbor quantum architecture for Shor's algorithm to factor an $
n $-bit number in $ O (\log^ 2 (n)) $ depth. Our implementation uses parallel phase …

Proposing an architecture that efficiently compensates for the inefficiencies of physical
hardware with extra resources is one of the key issues in quantum computer design …