Related papers: Simple Diagonal State Designs with Reconfigurable …
Random quantum processes play a central role both in the study of fundamental mixing processes in quantum mechanics related to equilibration, thermalisation and fast scrambling by black holes, as well as in quantum process design and…
Unitary designs are essential tools in several quantum information protocols. Similarly to other design concepts, unitary designs are mainly used to facilitate averaging over a relevant space, in this case, the unitary group…
We present an efficient algorithm for generating unitary maps on a $d$-dimensional Hilbert space from a time-dependent Hamiltonian through a combination of stochastic searches and geometric construction. The protocol is based on the…
We propose an experimental design for universal continuous-variable quantum computation that incorporates recent innovations in linear-optics-based continuous-variable cluster state generation and cubic-phase gate teleportation. The first…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
Hamiltonian inverse engineering enables the design of protocols for specific quantum evolutions or target state preparation. Perfect state transfer (PST) and remote entanglement generation are notable examples, as they serve as key…
Random unitaries are a central object of study in quantum information, with applications to quantum computation, quantum many-body physics, and quantum cryptography. Recent work has constructed unitary designs and pseudorandom unitaries…
Construction of virtual quantum states became possible due to the hypothesis on the nature of quantum states quant-ph/0212139. This study considers a stochastic geometrical background (stochastic gravitational background) generating…
We introduce a simple yet versatile protocol to inverse engineer the time-dependent Hamiltonian in two- and three level systems. In the protocol, by utilizing a universal SU(2) transformation, a given speedup goal can be obtained with large…
We extend the concept of Anderson localization, the confinement of quantum information in a spatially irregular potential, to quantum circuits. Considering matchgate circuits, generated by time-dependent spin-1/2 XY Hamiltonians, we give an…
Projective measurements of a single two-level quantum mechanical system (a qubit) evolving under a time-independent Hamiltonian produce a probability distribution that is periodic in the evolution time. The period of this distribution is an…
The capability to generate and manipulate quantum states in high-dimensional Hilbert spaces is a crucial step for the development of quantum technologies, from quantum communication to quantum computation. One-dimensional quantum walk…
The imaginary-time evolution of quantum states is integral to various fields, ranging from natural sciences to classical optimization or machine learning. Since simulating quantum imaginary-time evolution generally requires storing an…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
Adaptive quantum circuits, in which unitary operations, measurements, and feedback are used to steer quantum many-body systems, provide an exciting opportunity to generate new dynamical steady states. We introduce an adaptive quantum…
Recently double-bracket quantum algorithms have been proposed as a way to compile circuits for approximating eigenstates. Physically, they consist of appropriately composing evolutions under an input Hamiltonian together with diagonal…
We introduce an algorithm to compute Hamiltonian dynamics on digital quantum computers that requires only a finite circuit depth to reach an arbitrary precision, i.e. achieves zero discretization error with finite depth. This finite number…
We consider quantum state tomography with measurement procedures of the following type: First, we subject the quantum state we aim to identify to a know time evolution for a desired period of time. Afterwards we perform a measurement with a…
The nature of randomness and complexity growth in systems governed by unitary dynamics is a fundamental question in quantum many-body physics. This problem has motivated the study of models such as local random circuits and their…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…