Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code

• URL: http://arxiv.org/abs/2501.15200v1
• Date: Sat, 25 Jan 2025 12:49:07 GMT
• Title: Ion-Trap Chip Architecture Optimized for Implementation of Quantum Error-Correcting Code
• Authors: Jeonghoon Lee, Hyeongjun Jeon, Taehyun Kim,
• Abstract summary: We propose a new ion-trap optimized architecture for the efficient execution of both gate and non-transversal operations. By differentiating the regions for gates from those for non-transversal gates and syndrome extraction, our chip layout minimizes ion shuttling and simplifies physical implementations.
• Score: 5.89889361990138
• License:
• Abstract: We propose a new ion-trap architecture optimized for the efficient execution of both transversal and non-transversal gate operations in a two-dimensional color code. By differentiating the regions for transversal gates from those for non-transversal gates and syndrome extraction, which require distinct qubit connectivities, our chip layout minimizes ion shuttling and simplifies physical implementations. We also provide a dedicated transpiler and scheduler for this architecture, wherein the scheduler coordinates the sequence of operations and inserts the necessary swap and shuttling operations. Finally, we developed an error analyzer to evaluate the chip's performance across a variety of quantum algorithms. Simulation results confirm that our architecture can significantly increase success rates and reduce gate error probabilities, particularly lowering the effective two-qubit gate error probability to about 10^{-8} when a quantum error-correcting code of 31 physical qubits is employed. Our findings clearly show that the improvement in success rates clearly outweighs the runtime overhead, demonstrating that strategic hardware-scheduler co-design can advance quantum systems towards reliable, large-scale computing, potentially surpassing classical capabilities.

Related papers

• Realizing Lattice Surgery on Two Distance-Three Repetition Codes with Superconducting Qubits [31.25958618453706]
  We demonstrate lattice surgery between two distance-three repetition-code qubits by splitting a single distance-three surface-code qubit. We achieve an improvement in the value of the decoded $ZZ$ logical two-qubit observable compared to a similar non-encoded circuit.
  arXiv  Detail & Related papers  (2025-01-08T16:49:27Z)
• Efficient fault-tolerant code switching via one-way transversal CNOT gates [0.0]
  We present a code scheme that respects the constraints of FT circuit design by only making use of switching gates. We analyze application of the scheme to low-distance color codes, which are suitable for operation in existing quantum processors. We discuss how the scheme can be implemented with a large degree of parallelization, provided that logical auxiliary qubits can be prepared reliably enough.
  arXiv  Detail & Related papers  (2024-09-20T12:54:47Z)
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling [0.0]
  Two-dimensional grid of locally-interacting qubits is promising platform for fault tolerant quantum computing. In this paper, we show that such constrained architectures can also support fault tolerance. We demonstrate that error correction is possible and identify the classes of codes that are naturally suited to this platform.
  arXiv  Detail & Related papers  (2024-02-19T23:31:55Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Special-Purpose Quantum Processor Design [2.275405513780208]
  Full connectivity of qubits is necessary for most quantum algorithms. inserting swap gate to enable the two-qubit gates between uncoupled qubits significantly decreases the computation result fidelity. We propose a Special-Purpose Quantum Processor Design method that can design suitable structures for different quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-01T23:26:15Z)
• Space-efficient binary optimization for variational computing [68.8204255655161]
  We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem. We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
  arXiv  Detail & Related papers  (2020-09-15T18:17:27Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.