Deterministic one-way logic gates on a cloud quantum computer

• URL: http://arxiv.org/abs/2108.03865v2
• Date: Fri, 25 Mar 2022 08:30:29 GMT
• Title: Deterministic one-way logic gates on a cloud quantum computer
• Authors: Zhi-Peng Yang, Alakesh Baishya, Huan-Yu Ku, Yu-Ran Zhang, Anton Frisk Kockum, Yueh-Nan Chen, Fu-Li Li, Jaw-Shen Tsai, Franco Nori
• Abstract summary: One-way quantum computing is a promising candidate for fault-tolerant quantum computing. We propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms.
• Score: 1.4615254965614237
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One-way quantum computing is a promising candidate for fault-tolerant quantum computing. Here, we propose new protocols to realize a deterministic one-way CNOT gate and one-way $X$-rotations on quantum-computing platforms. By applying a delayed-choice scheme, we overcome a limit of most currently available quantum computers, which are unable to implement further operations on measured qubits or operations conditioned on measurement results from other qubits. Moreover, we decrease the error rate of the one-way logic gates, compared to the original protocol using local operations and classical communication (LOCC). In addition, we apply our deterministic one-way CNOT gate in the Deutsch-Jozsa algorithm to show the feasibility of our proposal. We demonstrate all these one-way gates and algorithms by running experiments on the cloud quantum-computing platform IBM Quantum Experience.

Related papers

• Efficient Generation of Multi-partite Entanglement between Non-local Superconducting Qubits using Classical Feedback [14.740159711831723]
  In gate-based quantum computing, the creation of entangled states or the distribution of entanglement across a quantum processor often requires circuit depths which grow with the number of entangled qubits. In teleportation-based quantum computing, one can deterministically generate entangled states with a circuit depth that is constant in the number of qubits.
  arXiv  Detail & Related papers  (2024-03-27T17:06:00Z)
• 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)
• 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)
• Comparing planar quantum computing platforms at the quantum speed limit [0.0]
  We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL) for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. We analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping.
  arXiv  Detail & Related papers  (2023-04-04T12:47:00Z)
• Testing quantum computers with the protocol of quantum state matching [0.0]
  The presence of noise in quantum computers hinders their effective operation. We suggest the application of the so-called quantum state matching protocol for testing purposes. For systematically varied inputs we find that the device with the smaller quantum volume performs better on our tests than the one with larger quantum volume.
  arXiv  Detail & Related papers  (2022-10-18T08:25:34Z)
• 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 trapped ion quantum computer with robust entangling gates and quantum coherent feedback [0.0]
  Chains of ions held in a linear Paul trap are a promising platform for constructing such quantum computers. We report on the construction of a small, five-qubit, universal quantum computer using $88textSr+$ ions in an RF trap.
  arXiv  Detail & Related papers  (2021-11-07T19:17:23Z)
• 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)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• 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)

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.