Related papers: Quantum State Preparation and Non-Unitary Evolutio…
Digital quantum simulators are among the most appealing applications of a quantum computer. Here we propose a universal, scalable, and integrated quantum computing platform based on tunable nonlinear electromechanical nano-oscillators. It…
We present a new algorithm for reducing an arbitrary unitary matrix U into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of…
A key problem in quantum computing is finding a viable technological path toward the creation of a scalable quantum computer. One possible approach toward solving part of this problem is distributed computing, which provides an effective…
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…
We consider noisy, non-local unitary operations or interactions, i.e. the corresponding evolutions are described by completely positive maps or master equations of Lindblad form. We show that by random local operations the completely…
In Ref. [Phys. Rev. A 100, 062317 (2019)], the authors reported an algorithm to implement, in a circuit-based quantum computer, a general quantum measurement (GQM) of a two-level quantum system, a qubit. Even though their algorithm seems…
The execution of quantum circuits on real systems has largely been limited to those which are simply time-ordered sequences of unitary operations followed by a projective measurement. As hardware platforms for quantum computing continue to…
We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially…
A quantum algorithm that solves the time-dependent Dirac equation on a digital quantum computer is developed and analyzed. The time evolution is performed by an operator splitting decomposition technique that allows for a mapping of the…
We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…
The quantum Fourier transform for discrete variable (dvQFT) is an efficient algorithm for several applications. It is usually considered for the processing of quantum bits (qubits) and its efficient implementation is obtained with two…
We propose a scalable qudit-based quantum processor using rotational states of polar molecules. Previously, molecular internal states were used to enlarge Hilbert space, whereas our approach uses optical tweezer arrays to achieve scalable…
Various quantum algorithms require usage of arbitrary diagonal operators as subroutines. For their execution on a physical hardware, those operators must be first decomposed into target device's native gateset and its qubit connectivity for…
In this paper, building on a previous analysis [1] of exact diagonalization of the space-discretized evolution operator for the study of properties of non-relativistic quantum systems, we present a substantial improvement to this method. We…
We introduce a variational hybrid classical-quantum algorithm to simulate the Lindblad master equation and its adjoint for time-evolving Markovian open quantum systems and quantum observables. Our method is based on a direct representation…
Quantum measurement is a fundamental yet experimentally challenging ingredient of quantum information processing. Many recent studies on quantum dynamics focus on expectation values of nonlinear observables; however, their experimental…
Implementing time-evolution operators in shallow quantum circuits is important for quantum simulations. The standard method of Trotterization requires a large number of gates to achieve practical accuracy. Variational Quantum Simulation…
Sample-based quantum diagonalization (SQD) is an algorithm for hybrid quantum-classical molecular simulation that has been of broad interest for application with noisy intermediate scale quantum (NISQ) devices. However, SQD does not always…
Reversing an unknown quantum evolution is of central importance to quantum information processing and fundamental physics, yet it remains a formidable challenge as conventional methods necessitate an infinite number of queries to fully…
Quantum speed-ups for dynamical simulation usually demand unitary time-evolution, whereas the large ODE/PDE systems encountered in realistic physical models are generically non-unitary. We present a universal moment-fulfilling dilation that…