Related papers: Solovay Kitaev Algorithm and Randomized Compilatio…
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the…
The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error correction. One outstanding issue is that of coherent errors…
Quantum computation promises to advance a wide range of computational tasks. However, current quantum hardware suffers from noise and is too small for error correction. Thus, accurately utilizing noisy quantum computers strongly relies on…
We conduct a systematic study of quantum circuits composed of multiple-control $Z$-rotation (MCZR) gates as primitives, since they are widely-used components in quantum algorithms and also have attracted much experimental interest in recent…
Successful implementations of quantum technologies require protocols and algorithms that use as few quantum resources as possible. However, many important quantum operations, such as continuous rotation gates in quantum computing or…
Quantum systems have potential to demonstrate significant computational advantage, but current quantum devices suffer from the rapid accumulation of error that prevents the storage of quantum information over extended periods. The…
We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the average fidelity, to which experimental data may…
We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) computers by applying a genetic algorithm to generate quantum circuits for state preparation. The algorithm can account for the specific…
Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…
Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise…
Growth in the complexity and capabilities of quantum information hardware mandates access to practical techniques for performance verification that function under realistic laboratory conditions. Here we experimentally characterise the…
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is directly related to the notion of stabilizer rank, which for a…
Classical simulation of noisy quantum circuits is essential for understanding quantum computing experiments. It enables scalable error characterization, analysis of how noise impacts quantum algorithms, and optimized implementations of…
Quantum gate set tomography (GST) has emerged as a promising method for the full characterization of quantum logic gates. In contrast to quantum process tomography (QPT), GST self-consistently and correctly accounts for state preparation…
When preparing a pure state with a quantum circuit, there is an unavoidable approximation error due to the compilation error in fault-tolerant implementation. A recently proposed approach called probabilistic state synthesis, where the…
Quantum algorithms require accurate representations of electronic states on a quantum device, yet the approximation of electronic wave functions for strongly correlated systems remains a profound theoretical challenge, with existing methods…
We introduce a Bayesian method for the estimation of single qubit errors in quantum devices, and use it to characterize these errors on three 27-qubit superconducting qubit devices. We self-consistently estimate up to seven parameters of…
Quantum circuit synthesis is the process in which an arbitrary unitary operation is decomposed into a sequence of gates from a universal set, typically one which a quantum computer can implement both efficiently and fault-tolerantly. As…
Quantum algorithms based on classical processing of individual samples have recently emerged as the most effective and robust methods to approximate ground-state wave functions of many-body quantum systems on pre-fault-tolerant and…
Semiconductor spin qubits demonstrated single-qubit gates with fidelities up to $99.9\%$ benchmarked in the single-qubit subspace. However, tomographic characterizations reveals non-negligible crosstalk errors in a larger space.…