Error-corrected Hadamard gate simulated at the circuit level
- URL: http://arxiv.org/abs/2312.11605v2
- Date: Thu, 27 Jun 2024 16:57:14 GMT
- Title: Error-corrected Hadamard gate simulated at the circuit level
- Authors: György P. Gehér, Campbell McLauchlan, Earl T. Campbell, Alexandra E. Moylett, Ophelia Crawford,
- Abstract summary: We simulate the logical Hadamard gate in the surface code under a circuit-level noise model.
Our paper is the first to do this for a unitary gate on a quantum error-correction code.
- Score: 42.002147097239444
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We simulate the logical Hadamard gate in the surface code under a circuit-level noise model, compiling it to a physical circuit on square-grid connectivity hardware. Our paper is the first to do this for a logical unitary gate on a quantum error-correction code. We consider two proposals, both via patch-deformation: one that applies a transversal Hadamard gate (i.e. a domain wall through time) to interchange the logical $X$ and $Z$ strings, and another that applies a domain wall through space to achieve this interchange. We explain in detail why they perform the logical Hadamard gate by tracking how the stabilisers and the logical operators are transformed in each quantum error-correction round. We optimise the physical circuits and evaluate their logical failure probabilities, which we find to be comparable to those of a quantum memory experiment for the same number of quantum error-correction rounds. We present syndrome-extraction circuits that maintain the same effective distance under circuit-level noise as under phenomenological noise. We also explain how a $SWAP$-quantum error-correction round (required to return the patch to its initial position) can be compiled to only four two-qubit gate layers. This can be applied to more general scenarios and, as a byproduct, explains from first principles how the "stepping" circuits of the recent Google paper [McEwen, Bacon, and Gidney, Quantum 7, 1172 (2023)] can be constructed.
Related papers
- Experimental fault-tolerant code switching [1.9088985324817254]
We present the first experimental implementation of fault-tolerant code switching between two codes.
We construct logical circuits and prepare 12 different logical states which are not accessible in a fault-tolerant way within a single code.
Our results experimentally open up a new route towards deterministic control over logical qubits with low auxiliary qubit overhead.
arXiv Detail & Related papers (2024-03-20T16:40:57Z) - Noisy decoding by shallow circuits with parities: classical and quantum [0.0]
We show that any classical circuit can correctly recover only a vanishingly small fraction of messages, if the codewords are sent over a noisy channel with positive error rate.
We give a simple quantum circuit that correctly decodes the Hadamard code with probability $Omega(varepsilon2)$ even if a $(1/2 - varepsilon)$-fraction of a codeword is adversarially corrupted.
arXiv Detail & Related papers (2023-02-06T15:37:32Z) - Protecting Expressive Circuits with a Quantum Error Detection Code [0.0]
We develop a quantum error detection code for implementations on existing trapped-ion computers.
By encoding $k$ logical qubits into $k+2$ physical qubits, this code presents fault-tolerant state initialisation and syndrome measurement circuits.
arXiv Detail & Related papers (2022-11-12T16:46:35Z) - A Quantum Algorithm for Computing All Diagnoses of a Switching Circuit [73.70667578066775]
Faults are by nature while most man-made systems, and especially computers, work deterministically.
This paper provides such a connecting via quantum information theory which is an intuitive approach as quantum physics obeys probability laws.
arXiv Detail & Related papers (2022-09-08T17:55:30Z) - A Complete Equational Theory for Quantum Circuits [58.720142291102135]
We introduce the first complete equational theory for quantum circuits.
Two circuits represent the same unitary map if and only if they can be transformed one into the other using the equations.
arXiv Detail & Related papers (2022-06-21T17:56:31Z) - Fault-tolerant circuit synthesis for universal fault-tolerant quantum
computing [0.0]
We present a quantum circuit synthesis algorithm for implementing universal fault-tolerant quantum computing based on geometricd codes.
We show how to synthesize the set of universal fault-tolerant protocols for $[[7,1,3]]$ Steane code and the syndrome measurement protocol of $[[23, 1, 7]]$ Golay code.
arXiv Detail & Related papers (2022-06-06T15:43:36Z) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor
Codes [5.352699766206807]
We study a next step - fault-tolerantly implementing quantum circuits.
We compute pseudo-thresholds for the Pauli error rate $p$ in a depolarizing noise model.
We see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end.
arXiv Detail & Related papers (2021-08-04T14:24:14Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - Hardware-Encoding Grid States in a Non-Reciprocal Superconducting
Circuit [62.997667081978825]
We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code.
We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
arXiv Detail & Related papers (2020-02-18T16:45:09Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.