Computational advantage of quantum random sampling

D Hangleiter, J Eisert - Reviews of Modern Physics, 2023 - APS
Quantum random sampling is the leading proposal for demonstrating a computational
advantage of quantum computers over classical computers. Recently the first large-scale …

Near-term quantum computing techniques: Variational quantum algorithms, error mitigation, circuit compilation, benchmarking and classical simulation

HL Huang, XY Xu, C Guo, G Tian, SJ Wei… - Science China Physics …, 2023 - Springer
Quantum computing is a game-changing technology for global academia, research centers
and industries including computational science, mathematics, finance, pharmaceutical …

Strong quantum computational advantage using a superconducting quantum processor

Y Wu, WS Bao, S Cao, F Chen, MC Chen, X Chen… - Physical review …, 2021 - APS
Scaling up to a large number of qubits with high-precision control is essential in the
demonstrations of quantum computational advantage to exponentially outpace the classical …

Quantum computational advantage via 60-qubit 24-cycle random circuit sampling

Q Zhu, S Cao, F Chen, MC Chen, X Chen, TH Chung… - Science bulletin, 2022 - Elsevier
To ensure a long-term quantum computational advantage, the quantum hardware should be
upgraded to withstand the competition of continuously improved classical algorithms and …

Information scrambling in quantum circuits

X Mi, P Roushan, C Quintana, S Mandra, J Marshall… - Science, 2021 - science.org
Interactions in quantum systems can spread initially localized quantum information into the
exponentially many degrees of freedom of the entire system. Understanding this process …

Power-efficient combinatorial optimization using intrinsic noise in memristor Hopfield neural networks

F Cai, S Kumar, T Van Vaerenbergh, X Sheng… - Nature …, 2020 - nature.com
To tackle important combinatorial optimization problems, a variety of annealing-inspired
computing accelerators, based on several different technology platforms, have been …

Quantum supremacy using a programmable superconducting processor

F Arute, K Arya, R Babbush, D Bacon, JC Bardin… - Nature, 2019 - nature.com
The promise of quantum computers is that certain computational tasks might be executed
exponentially faster on a quantum processor than on a classical processor 1. A fundamental …

Simulation of quantum circuits using the big-batch tensor network method

F Pan, P Zhang - Physical Review Letters, 2022 - APS
We propose a tensor network approach to compute amplitudes and probabilities for a large
number of correlated bitstrings in the final state of a quantum circuit. As an application, we …

Solving the sampling problem of the sycamore quantum circuits

F Pan, K Chen, P Zhang - Physical Review Letters, 2022 - APS
We study the problem of generating independent samples from the output distribution of
Google's Sycamore quantum circuits with a target fidelity, which is believed to be beyond the …

Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments

K Kechedzhi, SV Isakov, S Mandrà, B Villalonga… - Future Generation …, 2024 - Elsevier
Today's experimental noisy quantum processors can compete with and surpass all known
algorithms on state-of-the-art supercomputers for the computational benchmark task of …