Advantages and limitations of quantum routing

• URL: http://arxiv.org/abs/2206.01766v1
• Date: Fri, 3 Jun 2022 18:00:15 GMT
• Title: Advantages and limitations of quantum routing
• Authors: Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov and Eddie Schoute
• Abstract summary: Genuinely quantum operations could outperform Swap for the task of permuting qubits within an architecture. We consider quantum routing in two models: (1) allowing arbitrary two-qubit unitaries, or (2) allowing Hamiltonians with norm-bounded interactions.
• Score: 1.4050836886292872
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The Swap gate is a ubiquitous tool for moving information on quantum hardware, yet it can be considered a classical operation because it does not entangle product states. Genuinely quantum operations could outperform Swap for the task of permuting qubits within an architecture, which we call routing. We consider quantum routing in two models: (1) allowing arbitrary two-qubit unitaries, or (2) allowing Hamiltonians with norm-bounded interactions. We lower bound the circuit depth or time of quantum routing in terms of spectral properties of graphs representing the architecture interaction constraints, and give a generalized upper bound for all simple connected $n$-vertex graphs. In particular, we give conditions for a superpolynomial classical-quantum routing separation, which exclude graphs with a small spectral gap and graphs of bounded degree. Finally, we provide examples of a quadratic separation between gate-based and Hamiltonian routing models with a constant number of local ancillas per qubit and of an $\Omega(n)$ speedup if we also allow fast local interactions.

Related papers

• A diverse set of two-qubit gates for spin qubits in semiconductor quantum dots [5.228819198411081]
  We propose and verify a fast composite two-qubit gate scheme to extend the available two-qubit gate types. Our gate scheme limits the parameter requirements of all essential two-qubit gates to a common JDeltaE_Z region. With this versatile composite gate scheme, broad-spectrum two-qubit operations allow us to efficiently utilize the hardware and the underlying physics resources.
  arXiv  Detail & Related papers  (2024-04-29T13:37:43Z)
• 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)
• Speed limits of two-qubit gates with qudits [0.5852077003870417]
  We find an optimal theoretical bound for the speed limit of a two-qubit gate achieved using two qudits with a bounded interaction strength and arbitrarily fast single-qudit gates. We develop an open-source, machine learning assisted, quantum optimal control algorithm that can achieve a speedup close to the theoretical limit with near-perfect gate fidelity.
  arXiv  Detail & Related papers  (2023-12-14T18:49:11Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• 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)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Circuit connectivity boosts by quantum-classical-quantum interfaces [0.4194295877935867]
  High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. We numerically show the efficacy of our method for a Bell-state circuit for two increasingly distant qubits.
  arXiv  Detail & Related papers  (2022-03-09T19:00:02Z)
• Optimal model for fewer-qubit CNOT gates with Rydberg atoms [8.01045083320546]
  We report an optimal model about universal two- and three-qubit CNOT gates mediated by excitation to Rydberg states. Compared to conventional multi-pulse piecewise schemes, our gate can be realized by simultaneous excitation of atoms to the Rydberg states.
  arXiv  Detail & Related papers  (2021-12-16T09:54:52Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• 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)

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.