Related papers: A generic multi-Pauli compilation framework for li…
Stabilizer simulation can efficiently simulate an important class of quantum circuits consisting exclusively of Clifford gates. However, all existing extensions of this simulation to arbitrary quantum circuits including non-Clifford gates…
Any quantum program on a realistic quantum device must be compiled into an executable form while taking into account the underlying hardware constraints. Stringent restrictions on architecture and control imposed by physical platforms make…
Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this…
Simulating dynamics of physical systems is a key application of quantum computing, with potential impact in fields such as condensed matter physics and quantum chemistry. However, current quantum algorithms for Hamiltonian simulation yield…
Executing quantum algorithms over distributed quantum systems requires quantum circuits to be divided into sub-circuits which communicate via entanglement-based teleportation. Naively mapping circuits to qubits over multiple quantum…
Circuit cutting is a promising technique that leverages both quantum and classical computational resources, enabling the practical execution of large quantum circuits on noisy intermediate-scale quantum (NISQ) hardware. Recent approaches…
The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient…
Dynamical decoupling is a powerful technique to suppress errors in quantum systems originating from environmental couplings or from unwanted inter-particle interactions. However, it can also be used to selectively decouple specific…
Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum…
We introduce and investigate a data access model (approximate sample and query) that is satisfiable by the preparation and measurement of block encoded states, as well as in contexts such as classical quantum circuit simulation or Pauli…
Classical shadow tomography is a powerful randomized measurement protocol for predicting many properties of a quantum state with few measurements. Two classical shadow protocols have been extensively studied in the literature: the…
There have been significant recent advances in constructing theoretical and practical quantum error correcting codes that function well as quantum memories; however, performing fault-tolerant logical gates on these codes is less studied,…
Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot…
We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS). Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum…
Hamiltonian simulation is a key quantum algorithm for modeling complex systems. To implement a Hamiltonian simulation, it is typically decomposed into a list of Pauli strings, each corresponds to an RZ rotation gate with many Clifford…
Compiling quantum circuits into Clifford+$T$ gates is a central task for fault-tolerant quantum computing using stabilizer codes. In the near term, $T$ gates will dominate the cost of fault tolerant implementations, and any reduction in the…
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…
The performance of quantum algorithms for ground-state energy estimation is directly impacted by the quality of the initial state, where quality is traditionally defined in terms of the overlap of the input state with the target state. An…
Group twirling is crucial in quantum information processing, particularly in randomized benchmarking and random compiling. While protocols based on Pauli twirling have been effectively crafted to transform arbitrary noise channels into…
Quantum dynamics compilation is an important task for improving quantum simulation efficiency: It aims to synthesize multi-qubit target dynamics into a circuit consisting of as few elementary gates as possible. Compared to deterministic…