Building a fusion-based quantum computer using teleported gates
- URL: http://arxiv.org/abs/2404.01477v1
- Date: Mon, 1 Apr 2024 20:58:35 GMT
- Title: Building a fusion-based quantum computer using teleported gates
- Authors: Ashot Avanesov, Alexander Shurinov, Ivan Dyakonov, Stanislav Straupe,
- Abstract summary: We adopt a method of the quantum gate teleportation for converting circuit-based quantum computation primitives into fusion networks.
We construct two new fusion based quantum computation models and study their fault tolerance properties.
- Score: 41.94295877935867
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We adopt a method of the quantum gate teleportation for converting circuit-based quantum computation primitives into fusion networks. By using the presented scheme for the CNOT gate we construct translation of the circuit for the foliated surface code into a fault tolerant fusion network. Finally, we construct two new fusion based quantum computation models and study their fault tolerance properties.
Related papers
- Gate Teleportation in Noisy Quantum Networks with the SquidASM Simulator [1.5540058359482858]
We show how a gate teleportation scheme can be used to implement gate cutting.
We present simulation results for CNOT, DCNOT, CZ, SWAP, and Toffoli gates.
arXiv Detail & Related papers (2024-06-19T09:53:13Z) - 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) - 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) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - DQC$^2$O: Distributed Quantum Computing for Collaborative Optimization
in Future Networks [54.03701670739067]
We propose an adaptive distributed quantum computing approach to manage quantum computers and quantum channels for solving optimization tasks in future networks.
Based on the proposed approach, we discuss the potential applications for collaborative optimization in future networks, such as smart grid management, IoT cooperation, and UAV trajectory planning.
arXiv Detail & Related papers (2022-09-16T02:44:52Z) - 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) - Optimal Mapping for Near-Term Quantum Architectures based on Rydberg
Atoms [0.18188255328029254]
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.
arXiv Detail & Related papers (2021-09-09T11:33:43Z) - 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) - Quantum Federated Learning with Quantum Data [87.49715898878858]
Quantum machine learning (QML) has emerged as a promising field that leans on the developments in quantum computing to explore large complex machine learning problems.
This paper proposes the first fully quantum federated learning framework that can operate over quantum data and, thus, share the learning of quantum circuit parameters in a decentralized manner.
arXiv Detail & Related papers (2021-05-30T12:19:27Z) - A P4 Data Plane for the Quantum Internet [68.97335984455059]
A new -- quantum -- network stack will be needed to account for the fundamentally new properties of quantum entanglement.
In the non-quantum world, programmable data planes have broken the pattern of ossification of the protocol stack.
We demonstrate how we use P4$_16$ to explore abstractions and device architectures for quantum networks.
arXiv Detail & Related papers (2020-10-21T19:37:23Z)
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.