Related papers: A space-efficient quantum computer simulator suita…
Quantum circuit simulations are essential for the verification of quantum algorithms on behalf of real quantum devices. However, the memory requirements for such simulations grow exponentially with the number of qubits involved in quantum…
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. However, due to the noise and the limited scale of current quantum…
We implement the first open-source quantum computing emulator that includes arithmetic operations, the quantum Fourier transform, and quantum phase estimation. The emulator provides significant savings in both temporal and spatial resources…
Quantum processors are now able to run quantum circuits that are infeasible to simulate classically, creating a need for benchmarks that assess a quantum processor's rate of errors when running these circuits. Here, we introduce a general…
As the first useful Quantum Computers will be quantum simulators, here the minimum number of qubits necessary for the solution of the Schroedinger equation in simple test problems is evaluated. From the present preliminary results it…
Discrete translational symmetry plays a fundamental role in condensed matter physics and lattice gauge theories, enabling the analysis of systems that would otherwise be intractable. Despite this, many open problems remain. Quantum…
Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum…
The parameters of a quantum system grow exponentially with the number of involved quantum particles. Hence, the associated memory requirement goes well beyond the limit of best classic computers for quantum systems composed of a few dozen…
Designing quantum processors is a complex task that demands advanced verification methods to ensure their correct functionality. However, traditional methods of comprehensively verifying quantum devices, such as quantum process tomography,…
Analog quantum simulation leverages native hardware dynamics to emulate complex quantum systems with great efficiency by bypassing the quantum circuit abstraction. However, conventional compilation methods for analog simulators are…
The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to…
Recent demonstrations of superconducting quantum computers by Google and IBM and trapped-ion computers from IonQ fueled new research in quantum algorithms, compilation into quantum circuits, and empirical algorithmics. While online access…
Near-term quantum simulators are mostly based on qubit-based architectures. However, their imperfect nature significantly limits their practical application. The situation is even worse for simulating fermionic systems, which underlie most…
Quantum Variational Circuits (QVCs) are often claimed as one of the most potent uses of both near term and long term quantum hardware. The standard approaches to optimizing these circuits rely on a classical system to compute the new…
Computer simulation of observable phenomena is an indispensable tool for engineering new technology, understanding the natural world, and studying human society. Yet the most interesting systems are often complex, such that simulating their…
Efficient simulation of large-scale quantum algorithms is pivotal yet challenging due to the exponential growth of the state space inherent in both Sch\"odinger-based and Feynman-based methods. While Feynman-based simulators can be highly…
In one-way quantum computation (1WQC) model, universal quantum computations are performed using measurements to designated qubits in a highly entangled state. The choices of bases for these measurements as well as the structure of the…
Engineering design processes involve iterative design evaluations requiring numerous computationally intensive numerical simulations. Quantum algorithms promise substantial speedups for specific tasks relevant to engineering simulations.…
Classical simulation of quantum circuits is crucial for evaluating and validating the design of new quantum algorithms. However, the number of quantum state amplitudes increases exponentially with the number of qubits, leading to the…
We define formally decohered quantum computers (using density matrices), and present a simulation of them by a probabalistic classical Turing Machine. We study the slowdown of the simulation for two cases: (1) sequential quantum computers,…