Related papers: An Analog Analogue of a Digital Quantum Computatio…
We consider the problem of learning the Hamiltonian of a quantum system from estimates of Gibbs-state expectation values. Various methods for achieving this task were proposed recently, both from a practical and theoretical point of view.…
We present a framework that formulates the quest for the most efficient quantum state tomography scheme as an optimization problem which can be solved numerically. This approach can be applied to a broad spectrum of relevant setups…
The temporal evolution of a quantum system can be characterized by quantum process tomography, a complex task that consumes a number of physical resources scaling exponentially with the number of subsystems. An alternative approach to the…
ROM-based quantum computation (QC) is an alternative to oracle-based QC. It has the advantages of being less ``magical'', and being more suited to implementing space-efficient computation (i.e. computation using the minimum number of…
Quantum computers have the potential to expand the utility of lattice gauge theory to investigate non-perturbative particle physics phenomena that cannot be accessed using a standard Monte Carlo method due to the sign problem. Thanks to the…
The Schrieffer-Wolff transformation aims to solve degenerate perturbation problems and give an effective Hamiltonian that describes the low-energy dynamics of the exact Hamiltonian in the low-energy subspace of unperturbed Hamiltonian. This…
Searching a database is a central task in computer science and is paradigmatic of transport and optimization problems in physics. For an unstructured search, Grover's algorithm predicts a quadratic speedup, with the search time…
I provide an alternative way of seeing quantum computation. First, I describe an idealized classical problem solving machine that, thanks to a many body interaction, reversibly and nondeterministically produces the solution of the problem…
Quantum computers have the potential to efficiently solve a system of nonlinear ordinary differential equations (ODEs), which play a crucial role in various industries and scientific fields. However, it remains unclear which system of…
We use classes of Hilbert lattice equations for an alternative representation of Hilbert lattices and Hilbert spaces of arbitrary quantum systems that might enable a direct introduction of the states of the systems into quantum computers.…
Since Grover's seminal work which provides a way to speed up combinatorial search, quantum search has been studied in great detail. We propose a new method for designing quantum search algorithms for finding a marked element in the state…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
Quantum computers have the potential to transform the ways in which we tackle some important problems. The efforts by companies like Google, IBM and Microsoft to construct quantum computers have been making headlines for years. Equally…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately square-root of N queries to a quantum oracle, thus achieving a square-root speed-up over classical…
Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quantum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ…
We consider a hybrid quantum system consisting of a qubit system continuously evolving according to its fixed own Hamiltonian and a quantum computer. The qubit system couples to a quantum computer through a fixed interaction Hamiltonian,…
Just as any state of a single qubit or 2-level system can be obtained from any other state by a rotation operator parametrized by three real Euler angles, we show how any state of an n-qubit or 2^n-level system can be obtained from any…
We consider a family of unstructured problems, for which we propose a method for constructing analog, continuous-time quantum algorithms that are more efficient than their classical counterparts. In this family of problems, which we refer…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…