Exploiting Quantum Teleportation in Quantum Circuit Mapping

• URL: http://arxiv.org/abs/2011.07314v1
• Date: Sat, 14 Nov 2020 15:03:24 GMT
• Title: Exploiting Quantum Teleportation in Quantum Circuit Mapping
• Authors: Stefan Hillmich, Alwin Zulehner, and Robert Wille
• Abstract summary: We propose to exploit quantum teleportation as a possible complementary method. Quantum teleportation conceptually allows to move the state of a qubit over arbitrary long distances with constant overhead. The potential is demonstrated by a case study on the IBM Q Tokyo architecture which already shows promising improvements.
• Score: 2.9830377319529067
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers are constantly growing in their number of qubits, but continue to suffer from restrictions such as the limited pairs of qubits that may interact with each other. Thus far, this problem is addressed by mapping and moving qubits to suitable positions for the interaction (known as quantum circuit mapping). However, this movement requires additional gates to be incorporated into the circuit, whose number should be kept as small as possible since each gate increases the likelihood of errors and decoherence. State-of-the-art mapping methods utilize swapping and bridging to move the qubits along the static paths of the coupling map---solving this problem without exploiting all means the quantum domain has to offer. In this paper, we propose to additionally exploit quantum teleportation as a possible complementary method. Quantum teleportation conceptually allows to move the state of a qubit over arbitrary long distances with constant overhead---providing the potential of determining cheaper mappings. The potential is demonstrated by a case study on the IBM Q Tokyo architecture which already shows promising improvements. With the emergence of larger quantum computing architectures, quantum teleportation will become more effective in generating cheaper mappings.

Related papers

• Realizing fracton order from long-range quantum entanglement in programmable Rydberg atom arrays [45.19832622389592]
  Storing quantum information requires battling quantum decoherence, which results in a loss of information over time. To achieve error-resistant quantum memory, one would like to store the information in a quantum superposition of degenerate states engineered in such a way that local sources of noise cannot change one state into another. We show that this platform also allows to detect and correct certain types of errors en route to the goal of true error-resistant quantum memory.
  arXiv  Detail & Related papers  (2024-07-08T12:46:08Z)
• Hole Flying Qubits in Quantum Dot Arrays [1.0446041735532203]
  We show that electric field manipulation allows dynamical control of the SOI, enabling simultaneously the implementation of quantum gates during the transfer. We employ dynamical decoupling schemes to focus and preserve the spin state, leading to higher transfer fidelity.
  arXiv  Detail & Related papers  (2023-12-07T19:00:02Z)
• Distributing Quantum Circuits Using Teleportations [4.4117707680626514]
  Scalability is one of the most sought-after objectives in the field of quantum computing. Distributing a quantum circuit across a quantum network is one way to facilitate large computations using current quantum computers. We consider the problem of distributing a quantum circuit across a network of heterogeneous quantum computers, while minimizing the number of teleportations needed to implement gates spanning multiple computers.
  arXiv  Detail & Related papers  (2023-05-31T21:21:37Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Qubit teleportation between non-neighboring nodes in a quantum network [0.0]
  Future quantum internet applications will derive their power from the ability to share quantum information across the network. Here we realize quantum teleportation between remote, non-neighboring nodes in a quantum network. We demonstrate that once successful preparation of the teleporter is heralded, arbitrary qubit states can be teleported with fidelity above the classical bound.
  arXiv  Detail & Related papers  (2021-10-21T18:00:01Z)
• 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)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Quantum teleportation of physical qubits into logical code-spaces [12.44010756857228]
  Quantum gate teleportation has been proposed as an elegant solution to this problem. We create a maximally entangled state between a physical and an error-correctable logical qubit. We then demonstrate the teleportation of quantum information encoded on the physical qubit into the error-corrected logical qubit with fidelities up to 0.786.
  arXiv  Detail & Related papers  (2020-09-14T07:50:49Z)
• Teleporting quantum information encoded in fermionic modes [62.997667081978825]
  We consider teleportation of quantum information encoded in modes of a fermionic field. In particular, one is forced to distinguish between single-mode entanglement swapping, and qubit teleportation with or without authentication.
  arXiv  Detail & Related papers  (2020-02-19T14:15:16Z)

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.