Related papers: A Complexity Measure for Continuous Time Quantum A…
Many optimally scaling quantum simulation algorithms employ controlled time evolution of the Hamiltonian, which is typically the major bottleneck for their efficient implementation. This work establishes a compression protocol for encoding…
We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…
It has been argued that it is incompatible to maintain unitary time-evolution for time-dependent non-Hermitian Hamiltonians when the metric operator is explicitly time-dependent. We demonstrate here that the time-dependent Dyson equation…
We present a dynamic learning paradigm for "programming" a general quantum computer. A learning algorithm is used to find the control parameters for a coupled qubit system, such that the system at an initial time evolves to a state in which…
Dynamical aspects of information-theoretic and entropic measures of quantum systems are studied. First, we show that for the time-dependent harmonic oscillator, as well as for the charged particle in certain time-varying electromagnetic…
For the description of quantum evolution, the use of a manifestly time-dependent quantum Hamiltonian $\mathfrak{h}(t) =\mathfrak{h}^\dagger(t)$ is shown equivalent to the work with its simplified, time-independent alternative $G\neq…
In this paper we propose an approach for measuring growth of complexity of emerging patterns in complex systems such as cellular automata. We discuss several ways how a metric for measuring the complexity growth can be defined. This…
Chaos and complexity entail an entropic and computational obstruction to describing a system, and thus are intrinsically difficult to characterize. In this paper, we consider time evolution by Gaussian Unitary Ensemble (GUE) Hamiltonians…
In this work, we are interested in the detailed analysis of complexity aspects of both time and space that arises from the implementation of a quantum algorithm on a quantum based hardware. In particular, some steps of the implementation,…
A new approach to quantum walks is presented. Considering a quantum system undergoing some unitary discrete-time evolution in a directed graph G, we think of the vertices of G as sites that are occupied by the quantum system, whose internal…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…
Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration problem, for which a speed-up is shown by quantum computers…
We characterize good clocks, which are naturally subject to fluctuations, in statistical terms. We also obtain the master equation that governs the evolution of quantum systems according to these clocks and find its general solution. This…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
A quantum trajectory describes the evolution of a quantum system undergoing indirect measurement. In the discrete-time setting, the state of the system is updated by applying Kraus operators according to the measurement results. From an…
We consider a graph with a single quantum system at each node. The entire compound system evolves in discrete time steps by iterating a global evolution $U$. We require that this global evolution $U$ be unitary, in accordance with quantum…
We present a unitary control pulse design method for a scalable quantum computer architecture based on electron spins in lateral quantum dots. We employ simultaneous control of spin interactions and derive the functional forms of spin…
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum…
We show that the methods for quantification of system-environment entanglement that were recently developed for interactions that lead to pure decoherence of the system can be straightforwardly generalized to time-dependent Hamiltonians of…
An exact invariant is derived for $n$-degree-of-freedom Hamiltonian systems with general time-dependent potentials. The invariant is worked out in two equivalent ways. In the first approach, we define a special {\it Ansatz\/} for the…