Quantum process tomography of a controlled-phase gate for time-bin qubits

• URL: http://arxiv.org/abs/2003.04473v1
• Date: Tue, 10 Mar 2020 00:31:42 GMT
• Title: Quantum process tomography of a controlled-phase gate for time-bin qubits
• Authors: Hsin-Pin Lo, Takuya Ikuta, Nobuyuki Matsuda, Toshimori Honjo, William J. Munro, and Hiroki Takesue
• Abstract summary: Time-bin qubits, where information is encoded in a single photon at different times, have been widely used in optical fiber and waveguide based quantum communications. We have recently realized a time-bin qubit controlled-phase (C-Phase) gate using a 2 X 2 optical switch based on a lithium niobate waveguide. This study confirms that typical two-qubit logic gates used in quantum computational circuits can be implemented with time-bin qubits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Time-bin qubits, where information is encoded in a single photon at different times, have been widely used in optical fiber and waveguide based quantum communications. With the recent developments in distributed quantum computation, it is logical to ask whether time-bin encoded qubits may be useful in that context. We have recently realized a time-bin qubit controlled-phase (C-Phase) gate using a 2 X 2 optical switch based on a lithium niobate waveguide, with which we demonstrated the generation of an entangled state. However, the experiment was performed with only a pair of input states, and thus the functionality of the C-Phase gate was not fully verified. In this research, we used quantum process tomography to establish a process fidelity of 97.1%. Furthermore, we demonstrated the controlled-NOT gate operation with a process fidelity greater than 94%. This study confirms that typical two-qubit logic gates used in quantum computational circuits can be implemented with time-bin qubits, and thus it is a significant step forward for realization of distributed quantum computation based on time-bin qubits.

Related papers

• 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)
• Multiplexed Processing of Quantum Information Across an Ultra-wide Optical Bandwidth [0.0]
  We show how to process quantum information in parallel over multiplexed frequency channels using parametric homodyne detection for measurement of all the channels simultaneously. We demonstrate the multiplexed CV-QKD protocol in a proof-of-principle experiment, where we successfully carry out QKD over 23 uncorrelated spectral channels.
  arXiv  Detail & Related papers  (2023-10-26T23:50:20Z)
• Instantaneous nonlocal quantum computation and circuit depth reduction [7.148511452018054]
  Two-party quantum computation is a computation process with bipartite input and output, in which there are initial shared entanglement. In the first part, we show that a particular simplified subprocedure, known as a garden-hose gadget, cannot significantly reduce the entanglement cost. In the second part, we show that any unitary circuit consisting of layers of Clifford gates and T gates can be implemented using a circuit with measurements of depth proportional to the T-depth of the original circuit.
  arXiv  Detail & Related papers  (2023-06-15T17:57:50Z)
• 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)
• 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)
• 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)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• 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)
• Quantum process tomography with unsupervised learning and tensor networks [0.0]
  We present a new technique for performing quantum process tomography. We combine a tensor network representation of the channel with a data-driven optimization inspired by unsupervised machine learning. Our results go far beyond state-of-the-art, providing a practical and timely tool for benchmarking quantum circuits in current and near-term quantum computers.
  arXiv  Detail & Related papers  (2020-06-03T17:54:23Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Entanglement generation using a controlled-phase gate for time-bin qubits [0.0]
  We show a controlled-phase (C-Phase) gate for time-bin qubits that uses a 2x2 optical switch based on an electro-optic modulator. A Hong-Ou-Mandel interference measurement showed that the switch could work as a time-dependent beam splitter with a variable spitting ratio. We confirmed that two independent time-bin qubits were entangled as a result of the C-Phase gate operation with the switch.
  arXiv  Detail & Related papers  (2020-03-10T01:01:22Z)

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.