Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms

• URL: http://arxiv.org/abs/2109.04179v1
• Date: Thu, 9 Sep 2021 11:33:43 GMT
• Title: Optimal Mapping for Near-Term Quantum Architectures based on Rydberg Atoms
• Authors: Sebastian Brandhofer, Hans Peter B\"uchler, Ilia Polian
• Abstract summary: Quantum algorithms promise quadratic or exponential speedups for applications in cryptography, chemistry and material sciences. Topologies of today's quantum computers offer limited connectivity, leading to significant overheads for implementing such quantum algorithms. We present the first optimal quantum circuit-to-architecture mapping algorithm that exploits such one-dimensional topology displacements.
• Score: 0.18188255328029254
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum algorithms promise quadratic or exponential speedups for applications in cryptography, chemistry and material sciences. The topologies of today's quantum computers offer limited connectivity, leading to significant overheads for implementing such quantum algorithms. One-dimensional topology displacements that remedy these limits have been recently demonstrated for architectures based on Rydberg atoms, and they are possible in principle in photonic and ion trap architectures. We present the first optimal quantum circuit-to-architecture mapping algorithm that exploits such one-dimensional topology displacements. We benchmark our method on quantum circuits with up to 15 qubits and investigate the improvements compared with conventional mapping based on inserting swap gates into the quantum circuits. Depending on underlying technology parameters, our approach can decrease the quantum circuit depth by up to 58% and increase the fidelity by up to 29%. We also study runtime and fidelity requirements on one-dimensional displacements and swap gates to derive conditions under which one-dimensional topology displacements provide benefits.

Related papers

• Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian [0.0]
  We present a practical method for implementing universal quantum computation using the transverse-field Ising Hamiltonian. Our proposal is compatible with D-Wave devices, opening up possibilities for realizing large-scale gate-based quantum computers.
  arXiv  Detail & Related papers  (2024-02-29T12:47:29Z)
• 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)
• Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity [1.0360348400670518]
  We show that a minimal SWAP-gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
  arXiv  Detail & Related papers  (2024-02-01T10:32:05Z)
• 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)
• 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)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Moving Quantum States without SWAP via Intermediate Higher Dimensional Qudits [3.5450828190071646]
  This paper introduces a new formalism of moving quantum states without using SWAP operation. Moving quantum states through qubits have been attained with the adoption of temporary intermediate qudit states.
  arXiv  Detail & Related papers  (2021-06-16T19:21:53Z)
• Quantum Architecture Search via Deep Reinforcement Learning [0.0]
  It is non-trivial to design a quantum gate sequence for generating a particular quantum state with as fewer gates as possible. We propose a quantum architecture search framework with the power of deep reinforcement learning (DRL) to address this challenge. We demonstrate a successful generation of quantum gate sequences for multi-qubit GHZ states without encoding any knowledge of quantum physics in the agent.
  arXiv  Detail & Related papers  (2021-04-15T18:53:26Z)
• Classical variational simulation of the Quantum Approximate Optimization Algorithm [0.0]
  We introduce a method to simulate layered quantum circuits consisting of parametrized gates. A neural-network parametrization of the many-qubit wave function is used. For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers.
  arXiv  Detail & Related papers  (2020-09-03T15:55: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)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.