Quantum supremacy and quantum phase transitions

  title={Quantum supremacy and quantum phase transitions},
  author={Supanut Thanasilp and J. Tangpanitanon and M Lemonde and Ninnat Dangniam and Dimitris G Angelakis},
  journal={arXiv: Quantum Physics},
Demonstrating the ability of existing quantum platforms to perform certain computational tasks intractable to classical computers represents a cornerstone in quantum computing. Despite the growing number of such proposed "quantum supreme" tasks, it remains an important challenge to identify their direct applications. In this work, we describe how the approach proposed in Ref. [arXiv:2002.11946] for demonstrating quantum supremacy in generic driven analog many-body systems, such as those found… 

Figures from this paper

Efficiently Extracting Multi-Point Correlations of a Floquet Thermalized System

Nonequilibrium dynamics of many-body systems is challenging for classical computing, providing opportunities for demonstrating practical quantum computational advantage with analogue quantum



Quantum supremacy in driven quantum many-body systems.

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

Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of

Architectures for quantum simulation showing a quantum speedup

This work shows that benchmark settings exhibiting a quantum speedup may require little control in contrast to universal quantum computing, and proposes versatile and feasible schemes of two-dimensional dynamical quantum simulators showing such a quantumSpeedup.

Expressibility and trainability of parametrized analog quantum systems for machine learning applications

This work investigates how the interplay between external driving and disorder in the system dictates the trainability and expressibility of interacting quantum systems, and devise a protocol using quenched MBL dynamics which allows accurate trainability while keeping the overall dynamics in the quantum supremacy regime.

Quantum sampling problems, BosonSampling and quantum supremacy

This paper will review sampling problems and the arguments that have been used to deduce when sampling problems are hard for classical computers to simulate, and two classes of quantum sampling problems that demonstrate the supremacy of quantum algorithms are BosonSampling and Instantaneous Quantum Polynomial-time Sampling.

Quantum computational advantage using photons

Gaussian boson sampling was performed by sending 50 indistinguishable single-mode squeezed states into a 100-mode ultralow-loss interferometer with full connectivity and random matrix and sampling the output using 100 high-efficiency single-photon detectors, and the obtained samples were validated against plausible hypotheses exploiting thermal states, distinguishable photons, and uniform distribution.

A blueprint for demonstrating quantum supremacy with superconducting qubits

Nine superconducting qubits are used to demonstrate a promising path toward quantum supremacy and the scaling of errors and output with the number of qubits is explored in a five- to nine-qubit device.

Quantum supremacy using a programmable superconducting processor

Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.

Quantum Algorithms for Quantum Chemistry and Quantum Materials Science.

In this review, a detailed snapshot of current progress in quantum algorithms for ground-state, dynamics, and thermal-state simulation is taken and their strengths and weaknesses for future developments are analyzed.

Anticoncentration theorems for schemes showing a quantum speedup

This work proves two anticoncentration theorems and accompanying hardness results, one for circuit-based schemes, the other for quantum quench-type schemes for quantum simulations, and gives rise to a number of comparably simple, physically meaningful and resource-economical schemes showing a quantum speedup in one and two spatial dimensions.