Implementation and verification of coherent error suppression using randomized compiling for Grover's algorithm on a trapped-ion device
- URL: http://arxiv.org/abs/2503.05344v2
- Date: Fri, 28 Mar 2025 07:18:29 GMT
- Title: Implementation and verification of coherent error suppression using randomized compiling for Grover's algorithm on a trapped-ion device
- Authors: Masatoshi Ishii, Hammam Qassim, Tomochika Kurita, Joseph Emerson, Kazunori Maruyama, Hirotaka Oshima, Shintaro Sato,
- Abstract summary: We study the impact of coherent errors and their mitigation on a trapped-ion quantum computer.<n>We implement a range of Grover's algorithm circuits containing up to 10 qubits and 26 two-qubit gates.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In near-term quantum computations that do not employ error correction, noise can proliferate rapidly, corrupting the quantum state and making results unreliable. These errors originate from both decoherence and control imprecision. The latter can manifest as coherent noise that is especially detrimental. Here, we study the impact of coherent errors and their mitigation under standard error-reduction techniques, both theoretically and experimentally on a trapped-ion quantum computer. As a representative case study, we implement a range of Grover's algorithm circuits containing up to 10 qubits and 26 two-qubit gates. We demonstrate the effectiveness of randomized compiling (RC) and algorithm error detection (ED), where the latter is realized via post-selection on ancillary qubits that ideally return to the ground state at the end of each circuit. Our results highlight a synergetic effect: combining RC and ED yields the largest reductions in errors, indicating that these methods can work together to extend the capabilities of near-term quantum devices for moderately deep circuits.
Related papers
- Quantum Error Detection For Early Term Fault-Tolerant Quantum Algorithms [1.9556053645976448]
We present a framework for fault-tolerant compilation and simulation of quantum algorithms.
Finding optimal syndrome schedules improves algorithm success probabilities by an average of 6.7x.
We propose a simple data-driven approach to predict fault tolerant compilation parameters.
arXiv Detail & Related papers (2025-03-13T18:34:01Z) - 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) - Mitigating Quantum Gate Errors for Variational Eigensolvers Using Hardware-Inspired Zero-Noise Extrapolation [0.0]
We develop a recipe for mitigating quantum gate errors for variational algorithms using zero-noise extrapolation.
We utilize the fact that gate errors in a physical quantum device are distributed inhomogeneously over different qubits and qubit pairs.
We find that the estimated energy in the variational approach is approximately linear with respect to the circuit error sum.
arXiv Detail & Related papers (2023-07-20T18:00:03Z) - Improved quantum error correction with randomized compiling [0.0]
Current hardware for quantum computing suffers from high levels of noise.
We explore the role and effectiveness of using noise tailoring techniques to improve the performance of error correcting codes.
arXiv Detail & Related papers (2023-03-13T04:24:24Z) - 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) - Witnessing entanglement in trapped-ion quantum error correction under
realistic noise [41.94295877935867]
Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits.
We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms.
We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
arXiv Detail & Related papers (2022-12-14T20:00:36Z) - Benchmarking quantum logic operations relative to thresholds for fault
tolerance [0.02171671840172762]
We use gate set tomography to perform precision characterization of a set of two-qubit logic gates to study RC on a superconducting quantum processor.
We show that the average and worst-case error rates are equal for randomly compiled gates, and measure a maximum worst-case error of 0.0197(3) for our gate set.
arXiv Detail & Related papers (2022-07-18T17:41:58Z) - Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and
Cycle Benchmarking [50.8020641352841]
We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application.
We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor.
This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
arXiv Detail & Related papers (2022-01-08T23:12:55Z) - Fundamental limits of quantum error mitigation [0.0]
We show how error-mitigation algorithms can reduce the computation error as a function of their sampling overhead.
Our results provide a means to identify when a given quantum error-mitigation strategy is optimal and when there is potential room for improvement.
arXiv Detail & Related papers (2021-09-09T17:56:14Z) - Performance of teleportation-based error correction circuits for bosonic
codes with noisy measurements [58.720142291102135]
We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.
We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
arXiv Detail & Related papers (2021-08-02T16:12:13Z) - Leveraging Randomized Compiling for the QITE Algorithm [0.0]
Iterative algorithms like Quantum Imaginary Time Evolution are susceptible to coherent errors.
This article presents the combination of both noise tailoring using Randomized Compiling and error mitigation with a purification.
We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.
arXiv Detail & Related papers (2021-04-18T09:26:25Z) - Crosstalk Suppression for Fault-tolerant Quantum Error Correction with
Trapped Ions [62.997667081978825]
We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams.
This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits.
We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
arXiv Detail & Related papers (2020-12-21T14:20:40Z) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z)
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.