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 …
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
Quantum computing is a game-changing technology for global academia, research centers
and industries including computational science, mathematics, finance, pharmaceutical …
and industries including computational science, mathematics, finance, pharmaceutical …
Evidence for the utility of quantum computing before fault tolerance
Quantum computing promises to offer substantial speed-ups over its classical counterpart for
certain problems. However, the greatest impediment to realizing its full potential is noise that …
certain problems. However, the greatest impediment to realizing its full potential is noise that …
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 …
demonstrations of quantum computational advantage to exponentially outpace the classical …
Quantum computational advantage via 60-qubit 24-cycle random circuit sampling
To ensure a long-term quantum computational advantage, the quantum hardware should be
upgraded to withstand the competition of continuously improved classical algorithms and …
upgraded to withstand the competition of continuously improved classical algorithms and …
Quantum supremacy using a programmable superconducting processor
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 …
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
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 …
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
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 …
Google's Sycamore quantum circuits with a target fidelity, which is believed to be beyond the …
Closing the" quantum supremacy" gap: achieving real-time simulation of a random quantum circuit using a new sunway supercomputer
Y Liu, X Liu, F Li, H Fu, Y Yang, J Song… - Proceedings of the …, 2021 - dl.acm.org
We develop a high-performance tensor-based simulator for random quantum circuits
(RQCs) on the new Sunway supercomputer. Our major innovations include:(1) a near …
(RQCs) on the new Sunway supercomputer. Our major innovations include:(1) a near …
Tensorcircuit: a quantum software framework for the nisq era
TensorCircuit is an open source quantum circuit simulator based on tensor network
contraction, designed for speed, flexibility and code efficiency. Written purely in Python, and …
contraction, designed for speed, flexibility and code efficiency. Written purely in Python, and …