相关论文: A Complexity Measure for Continuous Time Quantum A…
We develop a general approach for monitoring and controlling evolution of open quantum systems. In contrast to the master equations describing time evolution of density operators, here, we formulate a dynamical equation for the evolution of…
The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual…
Many efforts have succeeded over the last decade at lengthening the timescale in which spin qubits loss quantum information under free evolution. With these design principles at a mature stage, it is now timely to widen the scope and take…
All elementary Hamiltonians in nature are expected to be invariant under rotation. Despite this restriction, we usually assume that any arbitrary measurement or unitary time evolution can be implemented on a physical system, an assumption…
We numerically analyze the complexity of unitary time-evolution and precursor operators in one- and two-qubit systems using the framework of Nielsen complexity geometry. We find that, as expected, the complexities of unitary time evolution…
We define the complexity of a continuous-time linear system to be the minimum number of bits required to describe its forward increments to a desired level of fidelity, and compute this quantity using the rate distortion function of a…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…
The staggered quantum walk is a type of discrete-time quantum walk model without a coin which can be generated on a graph using particular partitions of the graph nodes. We design Hamiltonians for potential realization of the staggered…
Precise identification of parameters governing quantum processes is a critical task for quantum information and communication technologies. In this work we consider a setting where system evolution is determined by a parameterized…
We introduce a method to perform imaginary time evolution in a controllable quantum system using measurements and conditional unitary operations. By performing a sequence of weak measurements based on the desired Hamiltonian constructed by…
Hybrid quantum-classical algorithms are among the most promising systems to implement quantum computing under the Noisy-Intermediate Scale Quantum (NISQ) technology. In this paper, at first, we investigate a quantum dynamics algorithm for…
The sensitivity of the evolution of quantum uncertainties to the choice of the initial conditions is shown via a complex nonlinear Riccati equation leading to a reformulation of quantum dynamics. This sensitivity is demonstrated for systems…
Quantum circuit complexity-a measure of the minimum number of gates needed to implement a given unitary transformation-is a fundamental concept in quantum computation, with widespread applications ranging from determining the running time…
Efficiency of time-evolution of quantum observables, and thermal states of quenched hamiltonians, is studied using time-dependent density matrix renormalization group method in a family of generic quantum spin chains which undergo a…
A rich variety of non-equilibrium dynamical phenomena and processes unambiguously calls for the development of general numerical techniques to probe and estimate a complex interplay between spatial and temporal degrees of freedom in…
We propose an iterative algorithm to investigate the cooperative evolution dominated by information encoded within state spaces in a random quantum cellular automaton. Inspired by the 2-gram model in statistical linguistics, the updates of…
It is expected that a quantum theory of gravity will radically alter our current notion of spacetime geometry. However, contrary to what was commonly assumed for many decades, quantum gravity effects could manifest in scales much larger…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
We construct a quantum searching model of a signed edge driven by a quantum walk. The time evolution operator of this quantum walk provides a weighted adjacency matrix induced by the assignment of sign to each edge. This sign can be…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…