Results 1 to 10 of about 22,509 (172)
Towards the Simplest Model of Quantum Supremacy: Atomic Boson Sampling in a Box Trap [PDF]
Entropy, 2023 We describe boson sampling of interacting atoms from the noncondensed fraction of Bose–Einstein-condensed (BEC) gas confined in a box trap as a new platform for studying computational ♯P-hardness and quantum supremacy of many-body systems.
Vitaly V. Kocharovsky +3 more
doaj +6 more sources
Quantum sampling problems, BosonSampling and quantum supremacy [PDF]
npj Quantum Information, 2017 There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics.
A. P. Lund +2 more
doaj +4 more sources
NISQ Computers: A Path to Quantum Supremacy
IEEE AccessThe quest for quantum advantage, wherein quantum computers surpass the computational capabilities of classical computers executing state-of-the-art algorithms on well-defined tasks, represents a pivotal race in the domain of quantum computing.
Muhammad AbuGhanem, Hichem Eleuch
doaj +4 more sources
Boundaries of quantum supremacy via random circuit sampling
npj Quantum Information, 2023 Google’s quantum supremacy experiment heralded a transition point where quantum computers can evaluate a computational task, random circuit sampling, faster than classical supercomputers.
Alexander Zlokapa +3 more
doaj +2 more sources
Effect of partial distinguishability on quantum supremacy in Gaussian Boson sampling [PDF]
npj Quantum Information, 2022 Gaussian boson sampling (GBS) allows for a way to demonstrate quantum supremacy with the relatively modest experimental resources of squeezed light sources, linear optics, and photon detection.
Junheng Shi, Tim Byrnes
doaj +2 more sources
Additive-error fine-grained quantum supremacy [PDF]
Quantum, 2020 It is known that several sub-universal quantum computing models, such as the IQP model, the Boson sampling model, the one-clean qubit model, and the random circuit model, cannot be classically simulated in polynomial time under certain conjectures in ...
Tomoyuki Morimae, Suguru Tamaki
doaj +2 more sources
Anticoncentration theorems for schemes showing a quantum speedup [PDF]
Quantum, 2018 One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being universal quantum computers, a state of affairs dubbed quantum speedup, or ...
Dominik Hangleiter +3 more
doaj +6 more sources
A blueprint for demonstrating quantum supremacy with superconducting qubits
, 2017 Fundamental questions in chemistry and physics may never be answered due to the exponential complexity of the underlying quantum phenomena. A desire to overcome this challenge has sparked a new industry of quantum technologies with the promise that ...
A. Dunsworth +31 more
core +2 more sources
Verification of Many-Qubit States [PDF]
Physical Review X, 2018 Verification is a task to check whether a given quantum state is close to an ideal state or not. In this paper, we show that a variety of many-qubit quantum states can be verified with only sequential single-qubit measurements of Pauli operators.
Yuki Takeuchi, Tomoyuki Morimae
doaj +4 more sources
Achieving quantum supremacy with sparse and noisy commuting quantum computations [PDF]
Quantum, 2017 The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures.
Michael J. Bremner +2 more
doaj +3 more sources