A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware

Villalonga, Benjamin; Boixo, Sergio; Nelson, Bron; Henze, Christopher E.; Rieffel, Eleanor; Biswas, Rupak; Mandrà, Salvatore

doi:10.1038/s41534-019-0196-1

Cited by 118 publications

(123 citation statements)

References 54 publications

Supporting

Mentioning

121

Contrasting

Order By: Relevance

“…Such approach allows to "swap" space and time to take advantage of low-depth quantum circuits (equivalent to a Wick rotation in the imaginary time direction). While the approach is interesting per se, the computational performance is lower than that one achieved by qFlex [30].…”

Section: Current State-of-the-artmentioning

confidence: 91%

“…In 2018, NASA and Google implemented a circuit simulator -qFlex -to compute amplitudes of arbitrary bitstrings and ran it on NASAs Electra and Pleiades supercomputers [30]. qFlex novel algorithmic design emphasizes communication avoiding and minimization of memory footprint, and it can also be reconfigured to optimize for local memory bandwidth.…”

Section: A Qflexmentioning

confidence: 99%

See 1 more Smart Citation

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Villalonga

Lyakh

Boixo

et al. 2020

Quantum Sci. Technol.

Self Cite

142

113

View full text Add to dashboard Cite

Noisy Intermediate-Scale Quantum (NISQ) computers aim to perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving "Quantum Supremacy", a major milestone in quantum computing. NISQ Supremacy requires comparison with a state-of-the-art classical simulator. We report HPC simulations of hard random quantum circuits (RQC), sustaining an average performance of 281 Pflop/s (true single precision) on Summit, currently the fastest supercomputer in the world. In addition, we propose a standard benchmark for NISQ computers based on qFlex, a tensor-network-based classical high-performance simulator of RQC, which are considered the leading proposal for Quantum Supremacy.

show abstract

Section: Current State-of-the-artmentioning

confidence: 91%

Section: A Qflexmentioning

confidence: 99%

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Villalonga

Lyakh

Boixo

et al. 2020

Quantum Sci. Technol.

Self Cite

142

113

View full text Add to dashboard Cite

show abstract

“…This is feasible for small circuits, as well as for circuits composed of Clifford gates [11] and few non-Clifford gates [12,13]. Classical simulations have been performed for quantum computations of up to 72 qubits, often exploiting subtle insights into the nature of specific quantum circuits involved [14,15]. Though practical for the present, classical simulations of quantum circuits are not scalable.…”

Section: Introductionmentioning

confidence: 99%

Accrediting outputs of noisy intermediate-scale quantum computing devices

2019

View full text Add to dashboard Cite

We present an accreditation protocol for the outputs of noisy intermediate-scale quantum devices. By testing entire circuits rather than individual gates, our accreditation protocol can provide an upperbound on the variation distance between noisy and noiseless probability distribution of the outputs of the target circuit of interest. Our accreditation protocol requires implementing quantum circuits no larger than the target circuit, therefore it is practical in the near term and scalable in the long term. Inspired by trap-based protocols for the verification of quantum computations, our accreditation protocol assumes that single-qubit gates have bounded probability of error. We allow for arbitrary spatial and temporal correlations in the noise affecting state preparation, measurements, single-qubit and two-qubit gates. We describe how to implement our protocol on real-world devices, and we also present a novel cryptographic protocol (which we call 'mesothetic' protocol) inspired by our accreditation protocol. measure [34-38] single qubits, however recently a protocol for a fully classical verifier was devised that relies on the widely believed intractability of a computational problem for quantum computers [39]. Other protocols for classical verifiers have also been devised, but they require interaction with multiple entangled and noncommunicating provers [40][41][42][43][44]. Cryptographic protocols show that with minimal assumptions, verification of the outputs of quantum computations of arbitrary size can be done efficiently, in principle.In practice, implementing cryptographic protocols in experiments remains challenging, especially in the near term. In experiments all the operations are noisy, as in figure 1(b), and the verifier does not possess noiseless quantum devices. Thus, the verifiability of protocols requiring noiseless devices for the verifier is not guaranteed. Moreover, the concept of scalability, which is of primary interest in cryptographic protocols, is not equivalent to that of practicality, which is essential for experiments. For instance, suppose that the target circuit contains a few hundred qubits and a few hundred gates. Cryptographic protocols require implementing this circuit on a large cluster state containing thousands of qubits and entangling gates [26][27][28][29][30][31]34] or on two spatially-separated devices sharing thousands of copies of Bell states [40,41]; or appending several teleportation gadgets to the target circuit (one for each T-gate in the circuit and six for each Hadamard gate) [33]; or building Feynman-Kitaev clock states, which require entangling the system with an auxiliary qubit per gate in the target circuit [35,39,43]. These protocols are scalable, as they require a number of additional qubits, gates and measurements growing linearly with the size of the target circuit, yet they remain impractical for NISQ devices.In this paper we present an accreditation protocol that provides an upper-bound on the variation distance between noisy and noiseless probability di...

show abstract

“…A). RQCs have also stimulated 2 the search for efficient classical algorithms which would show where exactly the limits of classical simulations are [17][18][19][20][21][22][23][24][25].…”

mentioning

confidence: 99%

“…(6)(7)(8)(9). To this end, we note that our algorithm can be straightforwardly combined with the fast sampling method in [24] to measure a large number of amplitudes. Following Fig.…”

mentioning

confidence: 99%

General-Purpose Quantum Circuit Simulator with Projected Entangled-Pair States and the Quantum Supremacy Frontier

et al. 2019

View full text Add to dashboard Cite

Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Here we bring together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the Projected Entangled-Pair States, to realize an effective general-purpose simulator of quantum algorithms. We apply our method to study random quantum circuits, which are outstanding candidates to demonstrate quantum supremacy on quantum computers that supports nearest-neighbour gate operations on a two-dimensional configuration. Our approach allows to quantify precisely the memory usage and the time requirements of random quantum circuits, thus showing the frontier of quantum supremacy. Applying this general quantum circuit simulator we measured amplitudes for a 7 × 7 lattice of qubits with depth (1 + 40 + 1) and double-precision numbers in 31 minutes using less than 93 TB memory on the Tianhe-2 supercomputer. Our analytic complexity bounds also show that simulating a 8 × l circuit (l > 8) with depth (1 + 40 + 1), or a 10 × l (l > 10) circuit with depth (1 + 32 + 1) is within reach of current supercomputers.Quantum computers offer the promise of efficiently solving certain problems that are intractable for classical computers, most famously factorizing large numbers [1][2][3]. With the rapid progress of various quantum systems towards Noisy Intermediate-Scale Quantum computing devices [4][5][6][7][8][9][10][11], we are now on the verge of quantum supremacy [12], i.e. demonstrating that an actual quantum computer has the ability to do a computation that no classical computers can tackle, an important milestone in the field of computer science. Various candidates have been suggested to demonstrate quantum supremacy, such as BosonSampling [13,14], the instantaneous quantum polynomial protocol [15,16] and random quantum circuits (RQCs) [3,17] which demand less physical resources and are easier to implement compared to, for instance, factorization. The central aspect for all these near-term supremacy proof-of-principle computations, which poses fundamental limitations to classical computations, is that the quantum states produced, and from which we wish to sample configurations, live in a Hilbert space that grows exponentially with the system size.In view of recent progresses in quantum computing hardware, it is important to find effective ways to simulate accurately quantum algorithms on classical computers. While the quantum circuit simulator we present can tackle generic circuits, in the following we focus on RQCs. They consist of a series of single and two-qubit gates which are applied to different qubits in a particular order. A group of commuting gates which can be applied simultaneously constitute one layer of the circuit, and the more groups of operations that do not commute, the deeper the circuit is. The qualification of random circuit comes from the fact that the single-qubit gates applied are chosen at random from a small set of them (for more details about...

show abstract

A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware

Cited by 118 publications

References 54 publications

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Accrediting outputs of noisy intermediate-scale quantum computing devices

General-Purpose Quantum Circuit Simulator with Projected Entangled-Pair States and the Quantum Supremacy Frontier

Contact Info

Product

Resources

About