Related papers: Accounting Principles are Simulated on Quantum Com…
As quantum computers of non-trivial size become available in the near future, it is imperative to develop tools to emulate small quantum computers. This allows for validation and debugging of algorithms as well as exploring…
Quantum computing harnesses quantum laws of nature to enable new types of algorithms, not efficiently possible on traditional computers, that may lead to breakthroughs in crucial areas like materials science and chemistry. There is rapidly…
In the effort to develop useful quantum computers simulating quantum machines with conventional computing resources is a key capability. Such simulations will always face limits preventing the emulation of quantum computers of substantial…
Quantum computers offer a new paradigm of computing with the potential to vastly outperform any imagineable classical computer. This has caused a gold rush towards new quantum algorithms and hardware. In light of the growing expectations…
Quantum approximate optimization algorithm (QAOA) is one of the popular quantum algorithms that are used to solve combinatorial optimization problems via approximations. QAOA is able to be evaluated on both physical and virtual quantum…
The simulation of many industrially relevant physical processes can be executed up to exponentially faster using quantum algorithms. However, this speedup can only be leveraged if the data input and output of the simulation can be…
We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization and Anderson transition can be…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…
Quantum computing has attracted considerable attention in recent years because it promises speed-ups that conventional supercomputers cannot offer, at least for some applications. Though existing quantum computers are, in most cases, still…
We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem…
Quantum computers are expected to be able to solve mathematical problems that cannot be solved using conventional computers. Many of these problems are of practical importance, especially in the areas of cryptography and secure…
Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century. Although many approximation methods have been introduced,…
Quantum computers can in principle solve certain problems exponentially more quickly than their classical counterparts. We have not yet reached the advent of useful quantum computation, but when we do, it will affect nearly all scientific…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate…
A new method for quantum computation in the presence of detected spontaneous emission is proposed. The method combines strong and fast (dynamical decoupling) pulses and a quantum error correcting code that encodes $n$ logical qubits into…
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.…
The new model of quantum computation is proposed, for which an effective algorithm of solving any task in NP is described. The work is based and inspired be the Grover's algorithm for solving NP-tasks with quadratic speedup compared to the…
Quantum computers hold great promise, but it remains a challenge to find efficient quantum circuits that solve interesting computational problems. We show that finding optimal quantum circuits is essentially equivalent to finding the…
We show that quantum circuits where the initial state and all the following quantum operations can be represented by positive Wigner functions can be classically efficiently simulated. This is true both for continuous-variable as well as…