One-hundred step measurement-based quantum computation multiplexed in the time domain with 25 MHz clock frequency

• URL: http://arxiv.org/abs/2006.11537v1
• Date: Sat, 20 Jun 2020 10:12:30 GMT
• Title: One-hundred step measurement-based quantum computation multiplexed in the time domain with 25 MHz clock frequency
• Authors: Warit Asavanant, Baramee Charoensombutamon, Shota Yokoyama, Takeru Ebihara, Tomohiro Nakamura, Rafael N. Alexander, Mamoru Endo, Jun-ichi Yoshikawa, Nicolas C. Menicucci, Hidehiro Yonezawa, and Akira Furusawa
• Abstract summary: We make a measurement system to demonstrate basic quantum operations multiplexed in the time domain with 25 MHz clock frequency. We verify transformations of the input states and their nonclassicalities for single-step quantum operations and also observe multi-step quantum operations up to one hundred steps.
• Score: 1.239576532851968
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Among various approaches toward quantum computation, measurement-based quantum computation (MBQC) multiplexed in time domain is currently a promising method for addressing the need for scalability. MBQC requires two components: cluster states and programmable measurements. With time-domain multiplexing, the former has been realized on an ultra-large-scale. The latter, however, has remained unrealized, leaving the large-scale cluster states unused. In this work, we make such a measurement system and use it to demonstrate basic quantum operations multiplexed in the time domain with 25 MHz clock frequency. We verify transformations of the input states and their nonclassicalities for single-step quantum operations and also observe multi-step quantum operations up to one hundred steps.

Related papers

• 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)
• 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)
• Physical Realization of Measurement Based Quantum Computation [0.0]
  Measurement based quantum computation (MBQC) introduced by Raussendorf and Briegel in 2001. In MBQC a large number of qubits are prepared in a highly entangled clusters, called cluster states. cluster states are physically realized using continuous variables (CV) and discrete variables (DV) approaches.
  arXiv  Detail & Related papers  (2023-01-08T11:52:38Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• An Amplitude-Based Implementation of the Unit Step Function on a Quantum Computer [0.0]
  We introduce an amplitude-based implementation for approximating non-linearity in the form of the unit step function on a quantum computer. We describe two distinct circuit types which receive their input either directly from a classical computer, or as a quantum state when embedded in a more advanced quantum algorithm.
  arXiv  Detail & Related papers  (2022-06-07T07:14:12Z)
• Localized Quantum Chemistry on Quantum Computers [0.6649973446180738]
  Quantum chemistry calculations are typically limited by the computation cost that scales exponentially with the size of the system. We present a quantum algorithm that combines a localization of multireference wave functions of chemical systems with quantum phase estimation.
  arXiv  Detail & Related papers  (2022-03-03T20:52:22Z)
• Quantum jump metrology in a two-cavity network [0.0]
  In interferometry, quantum physics is used to enhance measurement precision. An alternative approach is quantum metrology jump [L. A. Clark et al., Phys A 99, 022102] which deduces information by continuously monitoring an open quantum system. It is shown that the proposed approach can exceed the standard quantum limit without the need for complex quantum states being scalable.
  arXiv  Detail & Related papers  (2022-01-12T10:53:24Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• 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)
• 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)

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.