Related papers: Clifford recompilation for faster classical simula…
We give an efficient randomized algorithm for approximating an arbitrary element of $SU(2)$ by a product of Clifford+$T$ operators, up to any given error threshold $\epsilon>0$. Under a mild hypothesis on the distribution of primes, the…
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography.…
The quantum stabilizer formalism became foundational for understanding error correction soon after the realization of the first useful quantum error correction codes. Stabilizers provide a way to describe sets of quantum states which are…
We explore the implementation of pseudo-random single-qubit rotations and multi-qubit pseudo-random circuits constructed only from Clifford gates and the T-gate, a phase rotation of pi/4. Such a gate set would be appropriate for…
The Eastin-Knill theorem states that no quantum error correcting code can have a universal set of transversal gates. For CSS codes that can implement Clifford gates transversally it suffices to provide one additional non-Clifford gate, such…
Quantum error correction is believed to be essential for scalable quantum computation, but its implementation is challenging due to its considerable space-time overhead. Motivated by recent experiments demonstrating efficient manipulation…
We perform a comprehensive analysis of the quantum-enhanced Monte Carlo method [Nature, 619, 282-287 (2023)], aimed at identifying the optimal working point of the algorithm. We observe an optimal mixing Hamiltonian strength and analyze the…
Quantum Selected Configuration Interaction (QSCI) and an extended protocol known as Sample-based Quantum Diagonalization (SQD) have emerged as promising algorithms to solve the electronic Schr\"odinger equation with noisy quantum computers.…
We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one…
Quasi-probability decompositions (QPDs) have proven essential in many quantum algorithms and protocols -- one replaces a ``difficult'' quantum circuit with an ensemble of ``easier'' circuit variants whose weighted outcomes reproduce any…
Error mitigation is essential for the practical implementation of quantum algorithms on noisy intermediate-scale quantum (NISQ) devices. This work explores and extends Clifford Data Regression (CDR) to mitigate noise in quantum chemistry…
Quasi-Monte Carlo (qMC) methods are a powerful alternative to classical Monte-Carlo (MC) integration. Under certain conditions, they can approximate the desired integral at a faster rate than the usual Central Limit Theorem, resulting in…
Clifford noise reduction (CliNR) is a partial error correction scheme that reduces the logical error rate of Clifford circuits at the cost of a modest qubit and gate overhead. The CliNR implementation of an $n$-qubit Clifford circuit of…
We present a method for optimizing quantum control in experimental systems, using a subset of randomized benchmarking measurements to rapidly infer error. This is demonstrated to improve single- and two-qubit gates, minimize gate…
Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error…
We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion…
The quantum stochastic drift protocol, also known as qDRIFT, has become a popular algorithm for implementing time-evolution of quantum systems using randomised compiling. In this work we develop qFLO, a higher order randomised algorithm for…
Existing quantum systems provide very limited physical qubit counts, trying to execute a quantum algorithm/circuit on them that have a higher number of logical qubits than physically available lead to a compile-time error. Given that it is…
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford…
Standard randomized benchmarking protocols entail sampling from a unitary 2 design, which is not always practical. In this article we examine randomized benchmarking protocols based on subgroups of the Clifford group that are not unitary 2…