Related papers: Measurement-based deterministic imaginary time evo…
In this paper, we present a proof-of-concept quantum algorithm for simulating time-dependent Hamiltonian evolution by reducing the problem to simulating a time-independent Hamiltonian in a larger space using a discrete clock Hamiltonian…
Probabilities of the outcomes of consecutive quantum measurements can be obtained by construction probability amplitudes, thus implying unitary evolution of the measured system, broken each time a measurement is made. In practice, the…
Dynamical mean-field theory (DMFT) is a useful tool to analyze models of strongly correlated fermions like the Hubbard model. In DMFT, the lattice of the model is replaced by a single impurity site embedded in an effective bath. The…
Reconstructing the Hamiltonian of a quantum system is an essential task for characterizing and certifying quantum processors and simulators. Existing techniques either rely on projective measurements of the system before and after coherent…
Simulating the dynamics of complex quantum systems is a central application of quantum devices. Here, we propose leveraging the power of measurements to simulate short-time quantum dynamics of physically prepared quantum states in classical…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
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…
We discuss differential-- versus integral--equation based methods describing out--of thermal equilibrium systems and emphasize the importance of a well defined reduction to statistical observables. Applying the projection operator approach,…
We present methods that can provide an exponential savings in the resources required to perform dynamic parameter estimation using quantum systems. The key idea is to merge classical compressive sensing techniques with quantum control…
Having a broad range of methods available for implementing unitary operations is crucial for quantum information tasks. We study a dissipative process commonly used to describe dissipatively coupled systems and show that the process can…
In this article, we compare the methods implementing the real-time evolution operator generated by a unitary diagonal matrix where its entries obey a known underlying real function. When the size of the unitary diagonal matrix is small, a…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
The time evolution of a physical system is generally described by a differential equation, which can be solved numerically by adopting a difference scheme with space-time discretization. This discretization, as a numerical artifact, results…
Imaginary-time evolution has been shown to be a promising framework for tackling combinatorial optimization problems on quantum hardware. In this work, we propose a classical quantum-inspired strategy for solving combinatorial optimization…
Compared with time independent Hamiltonians, the dynamics of generic quantum Hamiltonians $H(t)$ are complicated by the presence of time ordering in the evolution operator. In the context of digital quantum simulation, this difficulty…
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. This approach typically relies on deep circuits and is therefore hampered by the substantial…
Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…
This article presents the first complete application of a quantum time-marching algorithm for simulating multidimensional linear transport phenomena with arbitrary boundaries, whereby the success probabilities are problem intrinsic. The…
Quantum pseudorandomness, also known as unitary designs, comprise a powerful resource for quantum computation and quantum engineering. While it is known in theory that pseudorandom unitary operators can be constructed efficiently, realizing…
We derive an upper bound for the time needed to implement a generic unitary transformation in a $d$ dimensional quantum system using $d$ control fields. We show that given the ability to control the diagonal elements of the Hamiltonian,…