Related papers: Possibilistic simulation of quantum circuits by cl…
While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design.…
Checking whether two quantum circuits are equivalent is important for the design and optimization of quantum-computer applications with real-world devices. We consider quantum circuits consisting of Clifford gates, a practically-relevant…
This study introduces a method for simulating quantum systems using electrical networks. Our approach leverages a generalized similarity transformation, which connects different Hamiltonians, enabling well-defined paths for quantum system…
Quantum circuit compilation comprises many computationally hard reasoning tasks that nonetheless lie inside #$\mathbf{P}$ and its decision counterpart in $\mathbf{PP}$. The classical simulation of general quantum circuits is a core example.…
We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
Magic states are essential for universal quantum computation and are widely viewed as a key source of quantum advantage, yet in realistic devices they are inevitably noisy. In this work, we characterize how noise on injected magic resources…
Recent breakthroughs have opened the possibility to intermediate-scale quantum computing with tens to hundreds of qubits, and shown the potential for solving classical challenging problems, such as in chemistry and condensed matter physics.…
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically…
We prove that one-way quantum computations have the same computational power as quantum circuits with unbounded fan-out. It demonstrates that the one-way model is not only one of the most promising models of physical realisation, but also a…
The rapid evolution of quantum devices fuels concerted efforts to experimentally establish quantum advantage over classical computing. Many demonstrations of quantum advantage, however, rely on computational assumptions and face…
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…
It is well known that a quantum circuit on $N$ qubits composed of Clifford gates with the addition of $k$ non Clifford gates can be simulated on a classical computer by an algorithm scaling as $\text{poly}(N)\exp(k)$[1]. We show that, for a…
High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. As main technical tool, we introduce…
Modeling non-Hermitian Hamiltonians is increasingly important in classical and quantum domains, especially when studying open systems, $PT$ symmetry, and resonances. However, the quantum simulation of these models has been limited by the…
While quantum computing can accomplish tasks that are classically intractable, the presence of noise may destroy this advantage in the absence of fault tolerance. In this work, we present a classical algorithm that runs in…
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…
Though Cliffords and matchgates are both examples of classically simulable circuits, they are considered simulable for different reasons. The celebrated Gottesman-Knill explains the simulability Cliffords, and the efficient simulability of…
We define a class of stochastic processes based on evolutions and measurements of quantum systems, and consider the complexity of predicting their long-term behavior. It is shown that a very general class of decision problems regarding…
The classical simulation of quantum circuits is of central importance for benchmarking near-term quantum devices. The fact that gates belonging to the Clifford group can be simulated efficiently on classical computers has motivated a range…