Related papers: Simulating Quantum Circuits by Model Counting
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…
With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical…
In this paper we continue to explore "hybrid" quantum circuit models in one-dimension with both unitary and measurement gates, focussing on the entanglement properties of wavefunction trajectories at long times, in the steady state. We…
Quantum computing has the potential to solve problems that are intractable for classical computers, with possible applications in areas such as drug discovery and high-energy physics. However, the practical implementation of quantum…
We study operator scrambling in quantum circuits built from `super-Clifford' gates. For such circuits it was established in arXiv:2002.12824 that the time evolution of operator entanglement for a large class of many-body operators can be…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
The stabilizer formalism is a scheme, generalizing well-known techniques developed by Gottesman [quant-ph/9705052] in the case of qubits, to efficiently simulate a class of transformations ("stabilizer circuits", which include the quantum…
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…
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…
Measuring global quantum properties-such as the fidelity to complex multipartite states-is both an essential and experimentally challenging task. Classical shadow estimation offers favorable sample complexity, but typically relies on…
In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with…
When considering a sequent-style proof system for quantum programs, there are certain elements of quantum mechanics that we may wish to capture, such as phase, dynamics of unitary transformations, and measurement probabilities. Traditional…
Quantum computing is a hotspot technology for its potential to accelerate specific applications by exploiting quantum parallelism. However, current physical quantum computers are limited to a relatively small scale, simulators based on…
Efficient methods for the simulation of quantum circuits on classic computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation,…
We present a system of equations between Clifford circuits, all derivable in the ZX-calculus, and formalised as rewrite rules in the Quantomatic proof assistant. By combining these rules with some non-trivial simplification procedures…
Quantum computation is a promising emerging technology which, compared to conventional computation, allows for substantial speed-ups e.g. for integer factorization or database search. However, since physical realizations of quantum…
Superconducting quantum circuits is one of the leading candidates for a universal quantum computer. Designing novel qubit and multiqubit superconducting circuits requires the ability to simulate and analyze the properties of a general…
Quantum computing promises to revolutionize several scientific and technological domains through fundamentally new ways of processing information. Among its most compelling applications is digital quantum simulation, where quantum computers…
Quantum computing promises a new approach to solving difficult computational problems, and the quest of building a quantum computer has started. While the first attempts on construction were succesful, scalability has never been achieved,…
We investigate Clifford+$T$ quantum circuits with a small number of $T$-gates. Using the sparsification lemma, we identify time complexity lower bounds in terms of $T$-gate count below which a strong simulator would improve on the…