Random quantum circuit sampling is proposed as the most promising approach to the task and has been implemented in experiments for achieving quantum advantage. A series of encouraging computational complexity results, based on some plausible assumptions, show that this task is impossible t...
Random quantum circuits for circuit sampling with superconducting qubits. See: https://arxiv.org/abs/1608.00263 Directory inst/rectangular contains circuits in a rectangular lattice. Each tar file nxm.tar.gz contains circuits for qubits in an n times m lattice. The files inside are named nxm_max...
A critical milestone on the path to useful quantum computers is the demonstration of a quantum computation that is prohibitively hard for classical computers—a task referred to as quantum supremacy. A leading near-term candidate is sampling from the pro
The computational complexity of quantum systems arises from the exponential growth of the Hilbert space dimension with system size. On near-term quantum processors whose practical complexity is limited by noise, random circuit sampling (RCS) has emerged as the most suitable candidate for a beyond-cla...
Characterizing quantum supremacy in near-term devices. Nat. Phys. 14, 595–600 (2018). Article CAS Google Scholar Bouland, A., Fefferman, B., Nirkhe, C. & Vazirani, U. On the complexity and verification of quantum random circuit sampling. Nat. Phys. 15, 159–163 (2019). Article ...
Quantum Computing Main The computational complexity of quantum systems arises from the exponential growth of the Hilbert space dimension with system size. On near-term quantum processors whose practical complexity is limited by noise, random circuit sampling (RCS) has emerged as the most suitable candi...
Building on this, we develop a quantum analogue of these classical algorithms using a quantum circuit model for random sampling of permutations for n n -qubit systems. As an application, we present a quantum algorithm for the two-sample randomization test to assess the difference of means in ...
In conclusion, the high-performance superconducting quantum computing system Zuchongzhi 2.1 has achieved a larger-scale random quantum circuit sampling with 60-qubit and 24-cycle, yielding a Hilbert space dimension up to 260. Compared with Zuchongzhi 2.0, our sampling task is about 5000 times more...
Random Sampling of Quantum States: a Survey of Methods And Some Issues Regarding the Overparametrized Method Jonas Maziero Sep 2015 The numerical generation of random quantum states (RQS) is an important procedure for investigations in quantum information science. Here, we review some methods that ma...
Leapfrogging Sycamore: Harnessing 1432 GPUs for 7× faster quantum random circuit sampling Random quantum circuit sampling serves as a benchmark to demonstrate quantum computational advantage. Recent progress in classical algorithms, especially t... XH Zhao,HS Zhong,F Pan,... - 《National Science ...