Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes

• URL: http://arxiv.org/abs/2109.14599v1
• Date: Wed, 29 Sep 2021 17:52:16 GMT
• Title: Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes
• Authors: Nicolas Delfosse, Michael E. Beverland and Maxime A. Tremblay
• Abstract summary: We establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. For local-expander quantum codes, we prove that any syndrome extraction circuit implemented with local Clifford gates has depth at least $Omega(n/sqrtN)$. This suggests that quantum LDPC codes are impractical with 2D local quantum hardware.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work we establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. Our bounds depend on the interplay between a pair of graphs: the Tanner graph of the set of measured Pauli operators, and the connectivity graph which represents the qubit connections required to implement the circuit. For local-expander quantum codes, which are promising for low-overhead quantum error correction, we prove that any syndrome extraction circuit implemented with local Clifford gates in a 2D square patch of $N$ qubits has depth at least $\Omega(n/\sqrt{N})$ where $n$ is the code length. Then, we propose two families of quantum circuits saturating this bound. First, we construct 2D local syndrome extraction circuits for quantum LDPC codes with bounded depth using only $O(n^2)$ ancilla qubits. Second, we design a family of 2D local syndrome extraction circuits for hypergraph product codes using $O(n)$ ancilla qubits with depth $O(\sqrt{n})$. Finally, we use circuit noise simulations to compare the performance of a family of hypergraph product codes using this last family of 2D syndrome extraction circuits with a syndrome extraction circuit implemented with fully connected qubits. While there is a threshold of about $10^{-3}$ for a fully connected implementation, we observe no threshold for the 2D local implementation despite simulating error rates of as low as $10^{-6}$. This suggests that quantum LDPC codes are impractical with 2D local quantum hardware. We believe that our proof technique is of independent interest and could find other applications. Our bounds on circuit sizes are derived from a lower bound on the amount of correlations between two subsets of qubits of the circuit and an upper bound on the amount of correlations introduced by each circuit gate, which together provide a lower bound on the circuit size.

Related papers

• Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
  CNOT circuits are a common building block of general quantum circuits. This article presents state-of-the-art algorithms for optimizing the number of CNOT gates. A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
  arXiv  Detail & Related papers  (2024-08-07T19:51:22Z)
• Reducing Quantum Error Correction Overhead with Versatile Flag-Sharing Syndrome Extraction Circuits [5.770351255180495]
  An efficient error syndrome extraction circuit should use fewer ancillary qubits, quantum gates, and measurements. We propose to design parallel flagged syndrome extraction with shared flag qubits for quantum stabilizer codes.
  arXiv  Detail & Related papers  (2024-06-30T06:35:48Z)
• A two-circuit approach to reducing quantum resources for the quantum lattice Boltzmann method [41.66129197681683]
  Current quantum algorithms for solving CFD problems use a single quantum circuit and, in some cases, lattice-based methods. We introduce the a novel multiple circuits algorithm that makes use of a quantum lattice Boltzmann method (QLBM) The problem is cast as a stream function--vorticity formulation of the 2D Navier-Stokes equations and verified and tested on a 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
  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.
  arXiv  Detail & Related papers  (2023-12-18T19:00:00Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49:44Z)
• Quantifying nonlocality: how outperforming local quantum codes is expensive [0.06091702876917279]
  Quantum low-density parity-check (LDPC) codes are a promising avenue to reduce the cost of constructing scalable quantum circuits. We show that quantum LDPC codes implemented through local interactions obey restrictions on their dimension $k$ and distance $d$. In particular, in 2D we show that a quantum LDPC with distance $n1/2 + epsilon$ code requires $Omega(n1/2 + epsilon)$ interactions of length $widetildeOmega(nepsilon)$.
  arXiv  Detail & Related papers  (2021-09-22T18:55:45Z)
• 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)
• Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
  We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes. We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code. We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
  arXiv  Detail & Related papers  (2020-12-07T23:22:40Z)
• Quantum coding with low-depth random circuits [2.4201087215689947]
  We use ensembles of low-depth random circuits with local connectivity to generate quantum error-correcting codes. For random stabilizer codes and the erasure channel, we find strong evidence that a depth $O(log N)$ random circuit is necessary. These results indicate that finite-rate quantum codes are practically relevant for near-term devices.
  arXiv  Detail & Related papers  (2020-10-19T18:25:30Z)

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.