Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer

• URL: http://arxiv.org/abs/2208.04881v2
• Date: Tue, 31 Oct 2023 18:46:58 GMT
• Title: Automated Generation of Shuttling Sequences for a Linear Segmented Ion Trap Quantum Computer
• Authors: Jonathan Durandau and Janis Wagner and Fr\'ed\'eric Mailhot and Charles-Antoine Brunet and Ferdinand Schmidt-Kaler and Ulrich Poschinger and Yves B\'erub\'e-Lauzi\`ere
• Abstract summary: A promising approach for scaling-up trapped-ion quantum computer platforms is by storing multiple trapped-ion qubit sets ('ion crystals') in segmented microchip traps. Here, we describe an algorithm for fully automated generation of shuttling schedules. We find that for quantum circuits which contain a fixed structure, advanced assignment algorithms can serve to reduce the shuttling overhead.
• Score: 26.47874938214435
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A promising approach for scaling-up trapped-ion quantum computer platforms is by storing multiple trapped-ion qubit sets ('ion crystals') in segmented microchip traps and to interconnect these via physical movement of the ions ('shuttling'). Already for realizing quantum circuits with moderate complexity, the design of suitable qubit assignments and shuttling schedules require automation. Here, we describe and test algorithms which address exactly these tasks. We describe an algorithm for fully automated generation of shuttling schedules, complying to constraints imposed by a given trap structure. Furthermore, we introduce different methods for initial qubit assignment and compare these for random circuit (of up to 20 qubits) and quantum Fourier transform-like circuits, and generalized Toffoli gates of up to 40 qubits each. We find that for quantum circuits which contain a fixed structure, advanced assignment algorithms can serve to reduce the shuttling overhead.

Related papers

• Entropy-driven entanglement forging [0.0]
  We show how entropy-driven entanglement forging can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices. Our findings indicate that our method, entropy-driven entanglement forging, can be used to adjust quantum simulations to the limitations of noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2024-09-06T16:54:41Z)
• Supervised binary classification of small-scale digits images with a trapped-ion quantum processor [56.089799129458875]
  We show that a quantum processor can correctly solve the basic classification task considered. With the increase of the capabilities quantum processors, they can become a useful tool for machine learning.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• Distributed quantum architecture search [0.0]
  Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. Quantum architecture search tackles this by adjusting circuit structures along with gate parameters to automatically discover high-performance circuit structures. We propose an end-to-end distributed quantum architecture search framework, where we aim to automatically design distributed quantum circuit structures for interconnected quantum processing units with specific qubit connectivity.
  arXiv  Detail & Related papers  (2024-03-10T13:28:56Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• Exploring ab initio machine synthesis of quantum circuits [0.0]
  Gate-level quantum circuits are often derived manually from higher level algorithms. Here we explore methods for the ab initio creation of circuits within a machine.
  arXiv  Detail & Related papers  (2022-06-22T17:48:29Z)
• Distribution of Quantum Circuits Over General Quantum Networks [3.7344608362649505]
  Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. We consider the problem of distributing quantum programs across a quantum network of heterogeneous quantum computers.
  arXiv  Detail & Related papers  (2022-06-13T19:30:48Z)
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm [0.0]
  Algorithm is up to $2$ orders of magnitudes faster than Sch$ddottexto$dinger-Feynman algorithm. We simulate larger random quantum circuits up to $104$ qubits, showing that this algorithm is an ideal tool to verify relatively shallow quantum circuits on near-term quantum computers.
  arXiv  Detail & Related papers  (2020-11-05T02:20:56Z)
• 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)
• 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.