Related papers: Universal Quantum Circuits
Random quantum circuits are commonly viewed as hard to simulate classically. In some regimes this has been formally conjectured, and there had been no evidence against the more general possibility that for circuits with uniformly random…
In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful…
Given a quantum gate implementing a $d$-dimensional unitary operation $U_d$, without any specific description but $d$, and permitted to use $k$ times, we present a universal probabilistic heralded quantum circuit that implements the exact…
Quantum computation and quantum simulation require a versatile gate set to optimize circuit compilation for practical applications. However, existing platforms are often limited to specific gate types or rely on parametric couplers to…
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…
Quantum computers can efficiently solve problems which are widely believed to lie beyond the reach of classical computers. In the near-term, hybrid quantum-classical algorithms, which efficiently embed quantum hardware in classical…
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…
We present the Quantum Virtual Machine (QVM), an end-to-end generic system for scalable execution of large quantum circuits with high fidelity on noisy and small quantum processors (QPUs) by leveraging gate virtualization. QVM exposes a…
Dynamic quantum circuits incorporate mid-circuit measurements and feed-forward operations originally intended to realize Quantum Error Correction. This paradigm has recently been utilized to prepare certain states and long-range entangling…
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…
Finite-depth quantum circuits preserve the long-range entanglement structure in quantum states and map between states within a gapped phase. To map between states of different gapped phases, we can use Sequential Quantum Circuits which…
This chapter is a short pedagogical introduction to the use of quantum logic for the simulation of complex quantum systems, including a simulation example on actual quantum hardware.
We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary…
With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess…
Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
Quantum computers hold promise to improve the efficiency of quantum simulations of materials and to enable the investigation of systems and properties more complex than tractable at present on classical architectures. Here, we discuss…
Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
Effective quantum computation relies upon making good use of the exponential information capacity of a quantum machine. A large barrier to designing quantum algorithms for execution on real quantum machines is that, in general, it is…