Related papers: A Complexity Measure for Continuous Time Quantum A…
We use quantum diffusive trajectories to prove that the time evolution of two-qubit entanglement under spontaneous emission can be fully characterized by optimal continuous monitoring. We analytically determine this optimal unraveling and…
We study entropy-bounded computational geometry, that is, geometric algorithms whose running times depend on a given measure of the input entropy. Specifically, we introduce a measure that we call range-partition entropy, which unifies and…
We study the temporal evolution of the circuit complexity for a subsystem in harmonic lattices after a global quantum quench of the mass parameter, choosing the initial reduced density matrix as the reference state. Upper and lower bounds…
Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter steps has gate complexity depending on the total Hamiltonian…
Estimating the eigenvalues of a unitary transformation U by standard phase estimation requires the implementation of controlled-U-gates which are not available if U is only given as a black box. We show that a simple trick allows to measure…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
Generalized Gibbs ensembles have been used as powerful tools to describe the steady state of integrable many-particle quantum systems after a sudden change of the Hamiltonian. Here we demonstrate numerically, that they can be used for a…
For a quantum walk on a graph, there exist many kinds of operators for the discrete-time evolution. We give a general relation between the characteristic polynomial of the evolution matrix of a quantum walk on edges and that of a kind of…
The observation of genuine quantum effects in systems governed by non-Hermitian Hamiltonians has been an outstanding challenge in the field. Here we simulate the evolution under such Hamiltonians in the quantum regime on a superconducting…
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…
The evolution of an open system is usually associated with the interaction of the system with an environment. A new method to study the open-type system evolution of a qubit (two-level atom) state is established. This evolution is…
In this work we study the unitary time-evolutions of quantum systems defined on infinite-dimensional separable time-dependent Hilbert spaces. Two possible cases are considered: a quantum system defined on a stochastic interval and another…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…
A continuous-time quantum walk on a dynamic graph evolves by Schr\"odinger's equation with a sequence of Hamiltonians encoding the edges of the graph. This process is universal for quantum computing, but in general, the dynamic graph that…
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number…
The classical and quantum dynamics of simple time-reparametrization- invariant models containing two degrees of freedom are studied in detail. Elimination of one ``clock'' variable through the Hamiltonian constraint leads to a description…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
When an experimentalist measures a time series of qubits, the outcomes generate a classical stochastic process. We show that measurement induces high complexity in these processes in two specific senses: they are inherently unpredictable…