scholarly journals Logical-qubit operations in an error-detecting surface code

Author(s):  
J. F. Marques ◽  
B. M. Varbanov ◽  
M. S. Moreira ◽  
H. Ali ◽  
N. Muthusubramanian ◽  
...  
2021 ◽  
Author(s):  
Jorge Marques ◽  
Boris Varbanov ◽  
Miguel Moreira ◽  
Hany Ali ◽  
Nandini Muthusubramanian ◽  
...  

Abstract Future fault-tolerant quantum computers will require storing and processing quantum data in logical qubits. We realize a suite of logical operations on a distance-two logical qubit stabilized using repeated error detection cycles. Logical operations include initialization into arbitrary states, measurement in the cardinal bases of the Bloch sphere, and a universal set of single-qubit gates. For each type of operation, we observe higher performance for fault-tolerant variants over non-fault-tolerant variants, and quantify the difference through detailed characterization. In particular, we demonstrate process tomography of logical gates, using the notion of a logical Pauli transfer matrix. This integration of high-fidelity logical operations with a scalable scheme for repeated stabilization is a milestone on the road to quantum error correction with higher-distance superconducting surface codes.


Quantum ◽  
2017 ◽  
Vol 1 ◽  
pp. 2 ◽  
Author(s):  
Theodore J. Yoder ◽  
Isaac H. Kim

The surface code is one of the most successful approaches to topological quantum error-correction. It boasts the smallest known syndrome extraction circuits and correspondingly largest thresholds. Defect-based logical encodings of a new variety called twists have made it possible to implement the full Clifford group without state distillation. Here we investigate a patch-based encoding involving a modified twist. In our modified formulation, the resulting codes, called triangle codes for the shape of their planar layout, have only weight-four checks and relatively simple syndrome extraction circuits that maintain a high, near surface-code-level threshold. They also use 25% fewer physical qubits per logical qubit than the surface code. Moreover, benefiting from the twist, we can implement all Clifford gates by lattice surgery without the need for state distillation. By a surgical transformation to the surface code, we also develop a scheme of doing all Clifford gates on surface code patches in an atypical planar layout, though with less qubit efficiency than the triangle code. Finally, we remark that logical qubits encoded in triangle codes are naturally amenable to logical tomography, and the smallest triangle code can demonstrate high-pseudothreshold fault-tolerance to depolarizing noise using just 13 physical qubits.


2007 ◽  
Vol 21 (13n14) ◽  
pp. 2505-2516
Author(s):  
M. S. BYRD ◽  
L.-A. WU

Proposals for scalable quantum computing devices suffer not only from decoherence due to their interaction with the environment, but also from severe engineering constraints. For example, our ability to implement quantum gates is determined, in part, by the experimentally available interactions with which quantum information may be processed. Here we review a practical solution to some of the major concerns, control and error prevention, addressing solid state proposals for quantum computing devices. Some noise is eliminated by encoding a logical qubit into two qubits, other noise is reduced by an efficient set of decoupling pulse sequences. The same encoding removes the need for single-qubit operations which pose a difficult design constraint. We also discuss several generalizations which follow from this work.


2012 ◽  
Vol 12 (11&12) ◽  
pp. 970-982
Author(s):  
Austin G. Fowler

We present an improved low-overhead implementation of surface code logical Hadamard ($H$). We describe in full detail logical $H$ applied to a single distance-7 double-defect logical qubit in an otherwise idle scalable array of such qubits. Our goal is to provide a clear description of logical $H$ and to emphasize that the surface code possesses low-overhead implementations of the entire Clifford group.


Author(s):  
J. Conrad ◽  
C. Chamberland ◽  
N. P. Breuckmann ◽  
B. M. Terhal

We explore a distance-3 homological CSS quantum code, namely the small stellated dodecahedron code, for dense storage of quantum information and we compare its performance with the distance-3 surface code. The data and ancilla qubits of the small stellated dodecahedron code can be located on the edges respectively vertices of a small stellated dodecahedron, making this code suitable for three-dimensional connectivity. This code encodes eight logical qubits into 30 physical qubits (plus 22 ancilla qubits for parity check measurements) in contrast with one logical qubit into nine physical qubits (plus eight ancilla qubits) for the surface code. We develop fault-tolerant parity check circuits and a decoder for this code, allowing us to numerically assess the circuit-based pseudo-threshold. This article is part of a discussion meeting issue ‘Foundations of quantum mechanics and their impact on contemporary society’.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Jino Heo ◽  
Seong-Gon Choi

AbstractWe propose a photonic procedure using cross-Kerr nonlinearities (XKNLs) to encode single logical qubit information onto four-photon decoherence-free states. In quantum information processing, a decoherence-free subspace can secure quantum information against collective decoherence. Therefore, we design a procedure employing nonlinear optical gates, which are composed of XKNLs, quantum bus beams, and photon-number-resolving measurements with linear optical devices, to conserve quantum information by encoding quantum information onto four-photon decoherence-free states (single logical qubit information). Based on our analysis in quantifying the affection (photon loss and dephasing) of the decoherence effect, we demonstrate the experimental condition to acquire the reliable procedure of single logical qubit information having the robustness against the decoherence effect.


Sign in / Sign up

Export Citation Format

Share Document