Native Conditional $i$SWAP Operation with Superconducting Artificial Atoms

• URL: http://arxiv.org/abs/2203.09791v2
• Date: Sun, 1 Oct 2023 11:54:32 GMT
• Title: Native Conditional $i$SWAP Operation with Superconducting Artificial Atoms
• Authors: Chang-Kang Hu, Jiahao Yuan, Bruno A. Veloso, Jiawei Qiu, Yuxuan Zhou, Libo Zhang, Ji Chu, Orkesh Nurbolat, Ling Hu, Jian Li, Yuan Xu, Youpeng Zhong, Song Liu, Fei Yan, Dian Tan, R. Bachelard, Alan C. Santos, C. J. Villas-Boas, Dapeng Yu
• Abstract summary: Coherent devices which process quantum states are required to route the quantum states that encode information. In this paper we demonstrate experimentally the smallest quantum transistor with a superconducting quantum processor. The architecture has strong potential in quantum information processing applications with superconducting qubits.
• Score: 14.279979630349288
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Controlling the flow of quantum information is a fundamental task for quantum computers, which is unfeasible to realize on classical devices. Coherent devices which can process quantum states are thus required to route the quantum states that encode information. In this paper we demonstrate experimentally the smallest quantum transistor with a superconducting quantum processor which is composed of a collector qubit, an emitter qubit, and a coupler (transistor gate). The interaction strength between the collector and emitter qubits is controlled by the frequency and state of the coupler, effectively implementing a quantum switch. Through the coupler-state-dependent Heisenberg (inherent) interaction between the qubits, a single-step (native) conditional $i$SWAP operation can be applied. To this end, we find that it is important to take into consideration higher energy level for achieving a native and high-fidelity transistor operation. By reconstructing the Quantum Process Tomography, we obtain an operation fidelity of $92.36\%$ when the transistor gate is open ($i$SWAP implementation) and $95.23 \%$ in the case of closed gate (identity gate implementation). The architecture has strong potential in quantum information processing applications with superconducting qubits.

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)
• Universal Quantum Computing with Field-Mediated Unruh--DeWitt Qubits [0.0]
  A set of universal quantum gates is a vital part of the theory of quantum computing. UDW detectors in simple settings enable a collection of gates known to provide universal quantum computing.
  arXiv  Detail & Related papers  (2024-02-15T18:19:45Z)
• Universal quantum computation using atoms in cross-cavity systems [0.0]
  We theoretically investigate a single-step implementation of both a universal two- (CNOT) and three-qubit (quantum Fredkin) gates in a cross-cavity setup. Within a high-cooper regime, the system exhibits an atomic-state-dependent $pi$-phase gate involving the two-mode single-photon bright and dark states.
  arXiv  Detail & Related papers  (2023-08-28T20:09:54Z)
• 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)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Fast quantum state transfer and entanglement for cavity-coupled many qubits via dark pathways [1.8352113484137624]
  Quantum state transfer (QST) and entangled state generation (ESG) are important building blocks for modern quantum information processing. We propose a general method to realize high-fidelity fast QST and ESG in a cavity-coupled many qubits system via its dark pathways.
  arXiv  Detail & Related papers  (2022-01-18T08:29:35Z)
• 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)
• Chiral Quantum Network with Giant Atoms [7.33811357166334]
  In superconducting quantum circuits (SQCs), chiral routing quantum information is often realized with the ferrite circulators. We propose a novel method to realize chiral quantum networks by exploiting giant atom effects in SQC platforms.
  arXiv  Detail & Related papers  (2021-06-24T17:08:49Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• 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.