Quantum supremacy in driven quantum many-body systems

• URL: http://arxiv.org/abs/2002.11946v3
• Date: Wed, 24 Mar 2021 02:06:10 GMT
• Title: Quantum supremacy in driven quantum many-body systems
• Authors: Jirawat Tangpanitanon, Supanut Thanasilp, Marc-Antoine Lemonde, Ninnat Dangiam, Dimitris G. Angelakis
• Abstract summary: We show that quantum supremacy can be obtained in generic periodically-driven quantum many-body systems. Our proposal opens the way for a large class of quantum platforms to demonstrate and benchmark quantum supremacy.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: A crucial milestone in the field of quantum simulation and computation is to demonstrate that a quantum device can compute certain tasks that are impossible to reproduce by a classical computer with any reasonable resources. Such a demonstration is referred to as quantum supremacy. One of the most important questions is to identify setups that exhibit quantum supremacy and can be implemented with current quantum technology. The two standard candidates are boson sampling and random quantum circuits. Here, we show that quantum supremacy can be obtained in generic periodically-driven quantum many-body systems. Our analysis is based on the eigenstate thermalization hypothesis and strongly-held conjectures in complexity theory. To illustrate our work, We give examples of simple disordered Ising chains driven by global magnetic fields and Bose-Hubbard chains with modulated hoppings. Our proposal opens the way for a large class of quantum platforms to demonstrate and benchmark quantum supremacy.

Related papers

• Quantum decoherence from complex saddle points [0.0]
  Quantum decoherence is the effect that bridges quantum physics to classical physics. We present some first-principle calculations in the Caldeira-Leggett model. We also discuss how to extend our work to general models by Monte Carlo calculations.
  arXiv  Detail & Related papers  (2024-08-29T15:35:25Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Quantum information and beyond -- with quantum candies [0.0]
  We investigate, extend, and greatly expand here "quantum candies" (invented by Jacobs) "quantum" candies describe some basic concepts in quantum information, including quantum bits, complementarity, the no-cloning principle, and entanglement. These demonstrations are done in an approachable manner, that can be explained to high-school students, without using the hard-to-grasp concept of superpositions and its mathematics.
  arXiv  Detail & Related papers  (2021-09-30T16:05:33Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• 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)
• Continuous Variable Quantum Advantages and Applications in Quantum Optics [0.0]
  This thesis focuses on three main questions in the continuous variable and optical settings. Where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from? What advantages can be gained in practice from the use of quantum information?
  arXiv  Detail & Related papers  (2021-02-10T02:43:27Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Sampling random quantum circuits: a pedestrian's guide [0.0]
  Recent experiments completed by collaborating research groups from Google, NASA Ames, UC Santa Barbara, and others provided compelling evidence that quantum supremacy has been achieved on a superconducting quantum processor. Unfortunately, understanding how this theoretical basis can be used to define quantum supremacy is an extremely difficult task. This article is an attempt to alleviate this difficulty in those who wish to understand the theoretical basis of Google's quantum supremacy experiments, by carefully walking through a derivation of their precise mathematical definition of quantum supremacy.
  arXiv  Detail & Related papers  (2020-07-10T19:26:08Z)
• Quantum key distribution based on the quantum eraser [0.0]
  Quantum information and quantum foundations are becoming popular topics for advanced undergraduate courses. We show that the quantum eraser, usually used to study the duality between wave and particle properties, can also serve as a generic platform for quantum key distribution.
  arXiv  Detail & Related papers  (2019-07-07T10:00:01Z)

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.