Related papers: A Complexity Measure for Continuous Time Quantum A…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
In this paper we approach the theory of continuous measurements and the associated unconditional and conditional (stochastic) master equations from the perspective of quantum information and quantum computing. We do so by showing how the…
The techniques employed to solve the interaction of a detector and a quantum field typically require perturbation methods. We introduce mathematical techniques to solve the time evolution of an arbitrary number of detectors interacting with…
Hamiltonian learning protocols are essential tools to benchmark quantum computers and simulators. Yet rigorous methods for time-dependent Hamiltonians and Lindbladians remain scarce despite their wide use. We close this gap by learning the…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
The evolution of entanglement entropy in quantum circuits composed of Haar-random gates and projective measurements shows versatile behavior, with connections to phase transitions and complexity theory. We reformulate the problem in terms…
Quantum entanglement is affected by unitary evolution, which spreads the entanglement through the whole system, and also by measurements, which usually tends to disentangle subsystems from the rest. Their competition has been known to…
Quantum information platforms enable analog quantum simulations, such as quantum annealing, offering a promising route to solving complex combinatorial optimization problems. Here, we propose a quantum information architecture based on…
The Bott index is an index that discerns among pairs of unitary matrices that can or cannot be approximated by a pair of commuting unitary matrices. It has been successfully employed to describe the approximate integer quantization of the…
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the…
The time evolution of entanglement tracks how information propagates in interacting quantum systems. We study entanglement entropy in CFT$_2$ with a time-dependent Hamiltonian. We perturb by operators with time-dependent source functions…
Recently, the notion of a quantum acceleration limit has been proposed for any unitary time evolution of quantum systems governed by arbitrary nonstationary Hamiltonians. This limit articulates that the rate of change over time of the…
Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…
We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of…
Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks. The scalability of…
Modeling the environment of a single qubit as an N dimensional quantum system, we show that the dynamics of the qubit alone, if measured in sufficient detail, can reveal the parameters of the qubit-environment coupling Hamiltonian. We show…
In this letter, we have considered an electron in a double quantum dot system interacting with a detector represented by a point contact. We present a dynamical model for the gradual decoherence of the density matrix due to the interaction…
We consider a quantum system dynamics caused by successive selective and non-selective measurements of the probe coupled to the system. For the finite measurement rate $\tau^{-1}$ and the system-probe interaction strength $\gamma$ we derive…
In a genetic algorithm, fluctuations of the entropy of a genome over time are interpreted as fluctuations of the information that the genome's organism is storing about its environment, being this reflected in more complex organisms. The…
Simulating physical systems has been an important application of classical and quantum computers. In this article we present an efficient classical algorithm for simulating time-dependent quantum mechanical Hamiltonians over constant…