Flexion: Adaptive In-Situ Encoding for On-Demand QEC in Ion Trap Systems
- URL: http://arxiv.org/abs/2504.16303v1
- Date: Tue, 22 Apr 2025 22:44:47 GMT
- Title: Flexion: Adaptive In-Situ Encoding for On-Demand QEC in Ion Trap Systems
- Authors: Keyi Yin, Xiang Fang, Zhuo Chen, Ang Li, David Hayes, Eneet Kaur, Reza Nejabati, Hartmut Haeffner, Wes Campbell, Eric Hudson, Jens Palsberg, Travis Humble, Yufei Ding,
- Abstract summary: A key near-term goal is to build a system capable of executing millions of logical operations reliably.<n>We propose a novel system architecture targeting MQC on trapped-ion quantum computers.<n>We propose Flexion, a hybrid encoding scheme that uses bare qubits for 1Q gates and QEC-encoded logical qubits for 2Q gates.
- Score: 16.77947483425163
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Recent advances in quantum hardware and quantum error correction (QEC) have set the stage for early demonstrations of fault-tolerant quantum computing (FTQC). A key near-term goal is to build a system capable of executing millions of logical operations reliably -- referred to as a megaquop quantum computer (MQC). In this work, we propose a novel system architecture targeting MQC on trapped-ion quantum computers (TIQC), leveraging their ultra-high-fidelity single-qubit gates (1Q) and efficient two-qubit (2Q) logical CNOT gates enabled by the quantum charge-coupled device (QCCD) architecture with the ion shuttling feature. We propose Flexion, a hybrid encoding scheme that uses bare qubits for 1Q gates and QEC-encoded logical qubits for 2Q gates. This approach avoids fully encoding all qubits, eliminating the overhead of gate synthesis, teleportation, and magic state distillation for non-Clifford gates. To support this, we design (1) a low-noise conversion protocol between bare and logical qubits, (2) a bare-logical hybrid instruction set architecture tailored for 2D grid-based TIQC, and (3) a compiler that minimizes conversion cost and optimizes the scheduling efficiency. We evaluate our approach on VQA and small-scale FTQC benchmarks, showing that it achieves superior performance improvements with significantly reduced resource overhead, offering a practical path toward early FTQC on TIQC.
Related papers
- Hardware-Software Co-design for Distributed Quantum Computing [7.928706053656785]
Distributed quantum computing (DQC) offers a pathway for scaling up quantum computing architectures beyond the confines of a single chip.<n> Entanglement is a crucial resource for implementing non-local operations in DQC.<n>We show that our hardware-software co-design improves both the runtime and the output fidelity under a realistic model of DQC.
arXiv Detail & Related papers (2025-03-24T04:19:32Z) - 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) - Universal Quantum Gate Set for Gottesman-Kitaev-Preskill Logical Qubits [0.0]
We report on the experimental demonstration of a universal gate set for the GKP code.
This includes single-qubit gates and -- for the first time -- a two-qubit entangling gate between logical code words.
We demonstrate single-qubit gates with a logical process fidelity as high as 0.960 and a two-qubit entangling gate with a logical process fidelity of 0.680.
arXiv Detail & Related papers (2024-09-09T09:23:36Z) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers.
Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
arXiv Detail & Related papers (2024-06-17T14:10:10Z) - Compiler for Distributed Quantum Computing: a Reinforcement Learning Approach [6.347685922582191]
We introduce a novel compiler that prioritizes reducing the expected execution time by jointly managing the generation and routing of EPR pairs.
We present a real-time, adaptive approach to compiler design, accounting for the nature of entanglement generation and the operational demands of quantum circuits.
Our contributions are twofold: (i) we model the optimal compiler for DQC using a Markov Decision Process (MDP) formulation, establishing the existence of an optimal algorithm, and (ii) we introduce a constrained Reinforcement Learning (RL) method to approximate this optimal compiler.
arXiv Detail & Related papers (2024-04-25T23:03:20Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Qubit efficient quantum algorithms for the vehicle routing problem on
NISQ processors [48.68474702382697]
Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry.
In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
arXiv Detail & Related papers (2023-06-14T13:44:35Z) - Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence.
We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
arXiv Detail & Related papers (2023-03-07T22:15:43Z) - Quantum Federated Learning with Entanglement Controlled Circuits and
Superposition Coding [44.89303833148191]
We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs)
We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs.
In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
arXiv Detail & Related papers (2022-12-04T03:18:03Z) - Practical implications of SFQ-based two-qubit gates [3.4982242928569405]
Scalability of today's superconducting quantum computers is limited due to the huge costs of generating/routing microwave control pulses per qubit from room temperature.
One active research area in both industry and academia is to push the classical controllers to the dilution refrigerator in order to increase the scalability of quantum computers.
Superconducting Single Flux Quantum (SFQ) is a classical logic technology with low power consumption and ultra-high speed.
arXiv Detail & Related papers (2022-02-03T05:05:24Z) - 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) - Accelerating variational quantum algorithms with multiple quantum
processors [78.36566711543476]
Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages.
Modern VQAs suffer from cumbersome computational overhead, hampered by the tradition of employing a solitary quantum processor to handle large data.
Here we devise an efficient distributed optimization scheme, called QUDIO, to address this issue.
arXiv Detail & Related papers (2021-06-24T08:18:42Z)
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.