Gate Teleportation in Noisy Quantum Networks with the SquidASM Simulator
- URL: http://arxiv.org/abs/2406.13405v1
- Date: Wed, 19 Jun 2024 09:53:13 GMT
- Title: Gate Teleportation in Noisy Quantum Networks with the SquidASM Simulator
- Authors: Valter Uotila,
- Abstract summary: 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.
- Score: 1.5540058359482858
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: We implement the gate teleportation algorithm for teleporting arbitrary two-qubit Clifford gates and the Toffoli gate within the context of multi-node quantum networks, utilizing the SquidASM quantum network simulator. We show how a gate teleportation scheme can be used to implement gate cutting, which is an important approach to realize large circuits in distributed quantum computing environments. The correction operations in teleportation are automatically constructed for arbitrary two-qubit Clifford gates. We present simulation results for CNOT, DCNOT, CZ, SWAP, and Toffoli gates. For the Toffoli gate, we apply a similar gate teleportation protocol with the difference that the correction operation becomes more complex since the gate is non-Clifford. We perform the simulations under varying conditions of quantum channel and device noise levels. The simulations provide valuable insights into the robustness and efficacy of the implemented algorithms, and they assist in identifying the critical components within quantum networks where noise primarily affects the execution of applications.
Related papers
- A Genetic Approach to Minimising Gate and Qubit Teleportations for Multi-Processor Quantum Circuit Distribution [6.207327488572861]
Distributed Quantum Computing (DQC) provides a means for scaling available quantum computation by interconnecting multiple quantum processor units (QPUs)
A key challenge in this domain is efficiently allocating logical qubits from quantum circuits to the physical qubits within QPUs, a task known to be NP-hard.
Traditional approaches have sought to reduce the number of required Bell pairs for executing non-local CNOT operations, a form of gate teleportation.
We introduce a novel meta-heuristic algorithm to minimise the network cost of executing a quantum circuit.
arXiv Detail & Related papers (2024-05-09T16:03:41Z) - 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) - Quantum Federated Learning with Entanglement Controlled Circuits and
Superposition Coding [44.89303833148191]
We develop a depth-controllable architecture of entangled slimmable quantum neural networks (eSQNNs)
We propose an entangled slimmable QFL (eSQFL) that communicates the superposition-coded parameters of eS-QNNs.
In an image classification task, extensive simulations corroborate the effectiveness of eSQFL.
arXiv Detail & Related papers (2022-12-04T03:18:03Z) - Modelling semiconductor spin qubits and their charge noise environment
for quantum gate fidelity estimation [0.9406493726662083]
The spin of an electron confined in semiconductor quantum dots is a promising candidate for quantum bit (qubit) implementations.
We present here a co-modelling framework for double quantum dot (DQD) devices and their charge noise environment.
We find an inverse correlation between quantum gate errors and quantum dot confinement.
arXiv Detail & Related papers (2022-10-10T10:12:54Z) - 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) - Accurate methods for the analysis of strong-drive effects in parametric
gates [94.70553167084388]
We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach.
We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
arXiv Detail & Related papers (2021-07-06T02:02:54Z) - Quantum Carry Lookahead Adders for NISQ and Quantum Image Processing [0.966840768820136]
Quantum circuits based on fault-tolerant gates and error-correcting codes should be used as they tolerant environmental noise.
Current machines called Noisy Intermediate Scale Quantum (NISQ) machines cannot support the overhead associated with faulttolerant design.
The risk for noise errors and decoherence increase as the number of gate layers (or depth) in the circuit increases.
arXiv Detail & Related papers (2021-06-09T01:02:39Z) - 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) - Using Reinforcement Learning to Perform Qubit Routing in Quantum
Compilers [0.0]
We propose a qubit routing procedure that uses a modified version of the deep Q-learning paradigm.
The system is able to outperform the qubit routing procedures from two of the most advanced quantum compilers currently available.
arXiv Detail & Related papers (2020-07-31T10:57:24Z) - Experimental implementation of non-Clifford interleaved randomized
benchmarking with a controlled-S gate [0.1759008116536278]
In some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions.
We demonstrate calibration of a low error non-Clifford Controlled-$fracpi2$ phase (CS) gate on a cloud based IBM Quantum computing.
arXiv Detail & Related papers (2020-07-16T18:00:02Z) - 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.