Related papers: Time evolution of quantum gates and the necessity …
There is increasing interest in quantum algorithms that are based on the imaginary-time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy post-processing…
The physically allowed quantum evolutions on a single qubit can be described in terms of their geometry. From a simple parameterisation of unital single-qubit channels, the canonical form of all such channels can be given. The related…
Recent experiments began to explore the topological properties of quench dynamics, i.e. the time evolution following a sudden change in the Hamiltonian, via tomography of quantum gases in optical lattices. In contrast to the well…
We represent both the states and the evolution of a quantum computer in phase space using the discrete Wigner function. We study properties of the phase space representation of quantum algorithms: apart from analyzing important examples,…
One of the principal obstacles on the way to quantum computers is the lack of distinguished basis in the space of unitary evolutions and thus the lack of the commonly accepted set of basic operations (universal gates). A natural choice,…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
This work concerns a study of the quantum mechanical extension of the work of Horwitz et al. [1] on the stability of classical Hamiltonian systems by geometrical methods. Simulations are carried out for several important examples, these…
Following a recent proposal of L. Wang and D. Babikov, J. Chem. Phys. 137, 064301 (2012), we theoretically illustrate the possibility of using the motional states of a $Cd^+$ ion trapped in a slightly anharmonic potential to simulate the…
This paper introduces complex dynamics methods to study dynamical quantum phase transitions in the one- and two-dimensional quantum 3-state Potts model. The quench involves switching off an infinite transverse field. The time-dependent…
The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets…
In quantum circuits, qubits and the quantum gates acting on them have traditionally been analysed using matrix algebra and Dirac notation. While powerful, these can be unintuitive for conceptual understanding and rapid problem solving. In…
Using the fact that any linear representation of a group can be embedded into permutations, we propose a constructive description of quantum behavior that provides, in particular, a natural explanation of the appearance of complex numbers…
Using general features of recent quantizations of the Hamiltonian constraint in loop quantum gravity and loop quantum cosmology, a dynamical interpretation of the constraint equation as evolution equation is presented. This involves a…
We introduce a model of computation based on quaternions, which is inspired on the quantum computing model. Pure states are vectors of a suitable linear space over the quaternions. Other aspects of the theory are the same as in quantum…
The performance of a quantum information processor depends on the precise control of phases introduced into the system during quantum gate operations. As the number of operations increases with the complexity of a computation, the phases of…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
We provide a precise definition and analysis of quantum causal histories (QCH). A QCH consists of a discrete, locally finite, causal pre-spacetime with matrix algebras encoding the quantum structure at each event. The evolution of quantum…
Focusing particularly on one-qubit and two-qubit systems, I explain how the quantum state of a system of n qubits can be expressed as a real function--a generalized Wigner function--on a discrete 2^n x 2^n phase space. The phase space is…
Quantum circuits consisting of random unitary gates and subject to local measurements have been shown to undergo a phase transition, tuned by the rate of measurement, from a state with volume-law entanglement to an area-law state. From 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…