Parallel window decoding enables scalable fault tolerant quantum computation.

Large-scale quantum computers have the potential to hold computational capabilities beyond conventional computers. However, the physical qubits are prone to noise which must be corrected in order to perform fault-tolerant quantum computations. Quantum Error Correction (QEC) provides the path for realizing such computations.

Cellular automaton decoders for topological quantum codes with noisy measurements and beyond.

We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, however, we focus on the three-dimensional toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We also numerically benchmark the performance of the decoder in the setting with measurement errors using various noise models.

Contextuality as a Resource for Models of Quantum Computation with Qubits.

A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for quantum computation with magic states for odd-prime dimensional qudits and two-dimensional systems with real wave functions. The phenomenon of state-independent contextuality poses a priori an obstruction to characterizing the case of regular qubits, the fundamental building block of quantum computation.

Fault-tolerant error correction with the gauge color code.

The constituent parts of a quantum computer are inherently vulnerable to errors. To this end, we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a universal set of computational operations with the minimal cost in quantum resources remains an important and ongoing challenge.

From Three-Photon Greenberger-Horne-Zeilinger States to Ballistic Universal Quantum Computation.

Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. A series of increasingly efficient proposals have shown linear-optical quantum computing to be formally scalable. However, existing schemes typically require extensive adaptive switching, which is experimentally challenging and noisy, thousands of photon sources per renormalized qubit, and/or large quantum memories for repeat-until-success strategies.

Measurement-based classical computation.

Measurement-based quantum computation (MBQC) is a model of quantum computation, in which computation proceeds via adaptive single qubit measurements on a multiqubit quantum state. It is computationally equivalent to the circuit model. Unlike the circuit model, however, its classical analog is little studied.

Stronger quantum correlations with loophole-free postselection.

One of the most striking nonclassical features of quantum mechanics is in the correlations it predicts between spatially separated measurements. In local hidden variable theories, correlations are constrained by Bell inequalities, but quantum correlations violate these. However, experimental imperfections lead to loopholes whereby LHV correlations are no longer constrained by Bell inequalities, and violations can be described by LHV theories.

Bound states for magic state distillation in fault-tolerant quantum computation.

Magic state distillation is an important primitive in fault-tolerant quantum computation. The magic states are pure nonstabilizer states which can be distilled from certain mixed nonstabilizer states via Clifford group operations alone. Because of the Gottesman-Knill theorem, mixtures of Pauli eigenstates are not expected to be magic state distillable, but it has been an open question whether all mixed states outside this set may be distilled.

Computational power of correlations.

We study the intrinsic computational power of correlations exploited in measurement-based quantum computation. By defining a general framework, the meaning of the computational power of correlations is made precise. This leads to a notion of resource states for measurement-based classical computation.