Related papers: Efficient quantum circuit simulation using a multi…
The study of out-of-equilibrium quantum many-body dynamics remains one of the most exciting research frontiers of physics, standing at the crossroads of our understanding of complex quantum phenomena and the realization of quantum…
Understanding the structure of multi-qubit quantum states is essential for both quantum information research and education, yet intuitive visualization beyond the single-qubit Bloch sphere remains challenging. In this work, we propose a…
In this paper we present a simple algorithm for representation of statistical data of any origin by complex probability amplitudes. Numerical simulation with Mathematica-6 is performed. The Bloch's sphere is used for visualization of…
A generalized Bloch sphere, in which the states of a quantum entity of arbitrary dimension are geometrically represented, is investigated and further extended, to also incorporate the measurements. This extended representation constitutes a…
We present a constructive method to translate small quantum circuits into their optical analogues, using linear components of present-day quantum optics technology only. These optical circuits perform precisely the computation that the…
Simulating quantum circuits classically is an important area of research in quantum information, with applications in computational complexity and validation of quantum devices. One of the state-of-the-art simulators, that of Bravyi et al,…
This Mathematica 5.2 package~\footnote{QDENSITY is available at http://www.pitt.edu/~tabakin/QDENSITY} is a simulation of a Quantum Computer. The program provides a modular, instructive approach for generating the basic elements that make…
Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any…
Based oh the properties of Lie algebras, in this work we develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann…
World-wide efforts aim at the realization of advanced quantum simulators and processors. However, despite the development of intricate hardware and pulse control systems, it may still not be generally known which effective quantum dynamics,…
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…
As present day quantum hardware is limited by various noise mechanisms, quantum advantage can only be reached in the near-term by designing noise-resilient quantum algorithms. In this work, we employ state-of-the-art quantum process…
Conventional vector-based simulators for quantum computers are quite limited in the size of the quantum circuits they can handle, due to the worst-case exponential growth of even sparse representations of the full quantum state vector as a…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
State-of-the-art cosmological simulations on classical computers are limited by time, energy, and memory usage. Quantum computers can perform some calculations exponentially faster than classical computers, using exponentially less energy…
Quantum circuit simulation is crucial for the development of quantum algorithms, particularly given the high cost and noise limitations of physical quantum hardware. While full-state quantum circuit simulation is commonly employed for…
We derive a rigorous upper bound on the classical computation time of finite-ranged tensor network contractions in $d \geq 2$ dimensions. Consequently, we show that quantum circuits of single-qubit and finite-ranged two-qubit gates can be…
We present a framework that utilizes quantum algorithms, an architecture aware quantum noise model and an ideal simulator to benchmark quantum computers. The benchmark metrics highlight the difference between the quantum computer evolution…
Two qubit density matrices, which are of X-shape, are a natural generalization of Bell Diagonal States (BDSs) recently simulated on the IBM quantum device. We generalize the previous results and propose a quantum circuit for simulation of a…
Quantum circuits consisting of Clifford and matchgates are two classes of circuits that are known to be efficiently simulatable on a classical computer. We introduce a unified framework that shows in a transparent way the special structure…