14,498 research outputs found
Optimized Surface Code Communication in Superconducting Quantum Computers
Quantum computing (QC) is at the cusp of a revolution. Machines with 100
quantum bits (qubits) are anticipated to be operational by 2020
[googlemachine,gambetta2015building], and several-hundred-qubit machines are
around the corner. Machines of this scale have the capacity to demonstrate
quantum supremacy, the tipping point where QC is faster than the fastest
classical alternative for a particular problem. Because error correction
techniques will be central to QC and will be the most expensive component of
quantum computation, choosing the lowest-overhead error correction scheme is
critical to overall QC success. This paper evaluates two established quantum
error correction codes---planar and double-defect surface codes---using a set
of compilation, scheduling and network simulation tools. In considering
scalable methods for optimizing both codes, we do so in the context of a full
microarchitectural and compiler analysis. Contrary to previous predictions, we
find that the simpler planar codes are sometimes more favorable for
implementation on superconducting quantum computers, especially under
conditions of high communication congestion.Comment: 14 pages, 9 figures, The 50th Annual IEEE/ACM International Symposium
on Microarchitectur
Experimental Bayesian Quantum Phase Estimation on a Silicon Photonic Chip
Quantum phase estimation is a fundamental subroutine in many quantum
algorithms, including Shor's factorization algorithm and quantum simulation.
However, so far results have cast doubt on its practicability for near-term,
non-fault tolerant, quantum devices. Here we report experimental results
demonstrating that this intuition need not be true. We implement a recently
proposed adaptive Bayesian approach to quantum phase estimation and use it to
simulate molecular energies on a Silicon quantum photonic device. The approach
is verified to be well suited for pre-threshold quantum processors by
investigating its superior robustness to noise and decoherence compared to the
iterative phase estimation algorithm. This shows a promising route to unlock
the power of quantum phase estimation much sooner than previously believed
Pulsed force sequences for fast phase-insensitive quantum gates in trapped ions
We show how to create quantum gates of arbitrary speed between trapped ions,
using a laser walking wave, with complete insensitivity to drift of the optical
phase, and requiring cooling only to the Lamb-Dicke regime. We present pulse
sequences that satisfy the requirements and are easy to produce in the
laboratory.Comment: 11 pages, 3 figure
Fault-tolerant quantum computation versus Gaussian noise
We study the robustness of a fault-tolerant quantum computer subject to
Gaussian non-Markovian quantum noise, and we show that scalable quantum
computation is possible if the noise power spectrum satisfies an appropriate
"threshold condition." Our condition is less sensitive to very-high-frequency
noise than previously derived threshold conditions for non-Markovian noise.Comment: 30 pages, 6 figure
- …