Results 21 to 30 of about 22,658 (300)
The Road to Quantum Computational Supremacy
The main purpose of this paper is to examine some (potential) applications of quantum computation in AI and to review the interplay between quantum theory and AI. For the readers who are not familiar with quantum computation, a brief introduction to it is provided, and a famous but simple quantum algorithm is introduced so that they can appreciate the ...
Rahul Kumar, Shivraj Patil
openalex +2 more sources
Noise Threshold of Quantum Supremacy [PDF]
Demonstrating quantum supremacy, a complexity-guaranteed quantum advantage against over the best classical algorithms by using less universal quantum devices, is an important near-term milestone for quantum information processing. Here we develop a threshold theorem for quantum supremacy with noisy quantum circuits in the pre-threshold region, where ...
Keisuke Fujii
openalex +3 more sources
Efficient verification of Boson Sampling [PDF]
The demonstration of quantum speedup, also known as quantum computational supremacy, that is the ability of quantum computers to outperform dramatically their classical counterparts, is an important milestone in the field of quantum computing.
Ulysse Chabaud +3 more
doaj +1 more source
Quantum supremacy and quantum phase transitions [PDF]
7 pages of main text, 6 ...
Supanut Thanasilp +4 more
openaire +2 more sources
Universal hash functions from quantum procedures
Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power.
F.M. Ablayev, M.T. Ziatdinov
doaj +1 more source
Quantum Supremacy Circuit Simulation on Sunway TaihuLight [PDF]
With the rapid progress made by industry and academia, quantum computers with dozens of qubits or even larger size are being realized. However, the fidelity of existing quantum computers often sharply decreases as the circuit depth increases. Thus, an ideal quantum circuit simulator on classical computers, especially on high-performance computers, is ...
Riling Li +4 more
openalex +4 more sources
Statistical Aspects of the Quantum Supremacy Demonstration
38 pages, 9 figures (v3.
Rinott, Yosef, Shoham, Tomer, Kalai, Gil
openaire +3 more sources
Low overhead universality and quantum supremacy using only Z control
We consider a model of quantum computation we call “varying Z” (VZ), defined by applying controllable Z-diagonal Hamiltonians in the presence of a uniform and constant external X field, and prove that it is universal, even in one dimension.
Brian Barch +2 more
doaj +1 more source
Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction [PDF]
We introduce a new open-source software library $Jet$, which uses task-based parallelism to obtain speed-ups in classical tensor-network simulations of quantum circuits.
Trevor Vincent +6 more
doaj +1 more source
How many qubits are needed for quantum computational supremacy? [PDF]
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of classical ...
Alexander M. Dalzell +3 more
doaj +1 more source

