Related papers: Using a quantum computer to investigate quantum ch…
Quasi-integrable Hamiltonian systems are of great interest in many research fields of physics and mathematics. In these systems, the phase space has regular and chaotic trajectories. These trajectories depend in part on the magnitude of…
Quantum computation is a promising emerging technology which, compared to conventional computation, allows for substantial speed-ups e.g. for integer factorization or database search. However, since physical realizations of quantum…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
The agenda of quantum algorithmic information theory, ordered `top-down,' is the quantum halting amplitude, followed by the quantum algorithmic information content, which in turn requires the theory of quantum computation. The fundamental…
We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal…
If a quantum computer is stabilized by fault-tolerant quantum error correction (QEC), then most of its resources (qubits and operations) are dedicated to the extraction of error information. Analysis of this process leads to a set of…
Science is rich in abstract concepts that capture complex processes in astonishingly simple ways. A prominent example is the reduction of molecules to simple graphs. This work introduces a design principle for parametrized quantum circuits…
The first application of a quantum algorithm to Feynman loop integrals is reviewed. The connection between quantum computing and perturbative quantum field theory is feasible due to fact that the two on-shell states of a Feynman propagator…
A measure describing the chaos of a dynamics was introduced by two complexities in information dynamics, and it is called the chaos degree. In particular, the entropic chaos degree has been used to characterized several dynamical maps such…
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel viewpoint for thinking about quantum computation and its powers. We consider the two major…
We show that efficient quantum computation is possible using a disordered Heisenberg spin-chain with `always-on' couplings. Such disorder occurs naturally in nanofabricated systems. Considering a simple chain setup, we show that an…
Recent studies have shown that there is a strong interplay between quantum complexity and quantum chaos. In this work, we consider a new method to study geometric complexity for interacting non-Gaussian quantum mechanical systems to…
We show that deterministic quantum computing with a single bit (DQC1) can determine whether the classical limit of a quantum system is chaotic or integrable using O(N) physical resources, where $N$ is the dimension of the Hilbert space of…
The environment of an open quantum system is usually modelled as a large many-body quantum system. However, when an isolated quantum system itself is a many-body quantum system, the question of how large and complex it must be in order to…
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
If a large Quantum Computer (QC) existed today, what type of physical problems could we efficiently simulate on it that we could not simulate on a classical Turing machine? In this paper we argue that a QC could solve some relevant physical…
A flagship application of quantum computers is the simulation of other quantum systems, including quantum field theories. In this article, we show how quantum computers can be employed to naturally calculate Feynman diagrams and their…
It is argued that the Aharonov-Casher set up could be used as the basic building block for quantum computation. We demonstrate explicitly in this scenario one- and two-qubit phase shift gates that are fault tolerant to deformations of the…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…