English
Related papers

Related papers: Benchmarking non-simulable quantum processes via s…

200 papers

The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…

Quantum Physics · Physics 2019-04-11 Sergey Bravyi , David Gosset

Randomized benchmarking is routinely used as an efficient method for characterizing the performance of sets of elementary logic gates in small quantum devices. In the measurement-based model of quantum computation, logic gates are…

Quantum Physics · Physics 2016-09-05 Rafael N. Alexander , Peter S. Turner , Stephen D. Bartlett

Quantum process tomography is a necessary tool for verifying quantum gates and diagnosing faults in architectures and gate design. We show that the standard approach of process tomography is grossly inaccurate in the case where the states…

We propose an efficient scheme for verifying quantum computations in the `high complexity' regime i.e. beyond the remit of classical computers. Previously proposed schemes remarkably provide confidence against arbitrarily malicious…

Quantum Physics · Physics 2017-05-24 Richard Jozsa , Sergii Strelchuk

We present a classical simulation method for fermionic quantum systems which, without loss of generality, can be represented by parity-preserving circuits made of two-qubit gates in a brick-wall structure. We map such circuits to a…

Quantum Physics · Physics 2025-04-29 Carolin Wille , Sergii Strelchuk

Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of…

Quantum Physics · Physics 2008-11-19 Richard Jozsa , Akimasa Miyake

Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general…

Quantum Physics · Physics 2025-10-29 Jordan Hines , Timothy Proctor

Symmetry is an important and unifying notion in many areas of physics. In quantum mechanics, it is possible to eliminate degrees of freedom from a system by leveraging symmetry to identify the possible physical transitions. This allows us…

Quantum Physics · Physics 2023-11-20 Rahul Bandyopadhyay , Alex H. Rubin , Marina Radulaski , Mark M. Wilde

The goal of benchmarking is to determine how far the output of a noisy system is from its ideal behavior; this becomes exceedingly difficult for large quantum systems where classical simulations become intractable. A common approach is to…

Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine learning and variational quantum algorithms. In such…

Quantum Physics · Physics 2021-02-26 Ellen Derbyshire , Rawad Mezher , Theodoros Kapourniotis , Elham Kashefi

We construct a gate and time-independent noise model that results in the output of a logical randomized benchmarking protocol oscillating rather than decaying exponentially. To illustrate our idea, we first construct an example in standard…

Quantum Physics · Physics 2022-12-13 Athena Ceasura , Pavithran Iyer , Joel J. Wallman , Hakop Pashayan

Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…

Quantum Physics · Physics 2020-04-17 Huangjun Zhu , Haoyu Zhang

Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…

Quantum Physics · Physics 2023-12-29 Margarite L. LaBorde , Mark M. Wilde

Randomized Benchmarking allows to efficiently and scalably characterize the average error of an unitary 2-design such as the Clifford group $\mathcal{C}$ on a physical candidate for quantum computation, as long as there are no…

Quantum Physics · Physics 2015-11-04 T. Chasseur , F. K. Wilhelm

Randomized benchmarking provides a tool for obtaining precise quantitative estimates of the average error rate of a physical quantum channel. Here we define real randomized benchmarking, which enables a separate determination of the average…

Quantum Physics · Physics 2018-08-23 A. K. Hashagen , S. T. Flammia , D. Gross , J. J. Wallman

We aim to establish a scalable scheme for characterising diagonal non-Clifford gates for single- and multi-qudit systems; \(d\) is a prime-power integer. By employing cyclic operators and a qudit T gate, we generalise the dihedral…

Quantum Physics · Physics 2024-08-02 David Amaro-Alcalá , Barry C. Sanders , Hubert de Guise

Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can results in significant overhead due to the exponentially growing size of some…

Accurate benchmarking of quantum gates is crucial for understanding and enhancing the performance of quantum hardware. A standard method for this is interleaved benchmarking, a technique which estimates the error on an interleaved target…

Quantum simulation of many-body systems, particularly using ultracold atoms and trapped ions, presents a unique form of quantum control -- it is a direct implementation of a multi-qubit gate generated by the Hamiltonian. As a consequence,…

Quantum Gases · Physics 2024-11-19 Aditya Prakash , Bharath Hebbe Madhusudhana

The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…

Quantum Physics · Physics 2018-10-12 Mark Steudtner , Stephanie Wehner