相关论文: Artificial Orbitals and a Solution to Grover's Pro…
We propose a quantum algorithm to obtain the lowest eigenstate of any Hamiltonian simulated by a quantum computer. The proposed algorithm begins with an arbitrary initial state of the simulated system. A finite series of transforms is…
Quantum algorithms for probing ground-state properties of quantum systems require good initial states. Projection-based methods such as eigenvalue filtering rely on inputs that have a significant overlap with the low-energy subspace, which…
This paper reviews the standard algorithm for converting spacecraft state vectors to Keplerian orbital elements with a focus on its computer implementation. It analyzes the shortcomings of the scheme as described in the literature, and…
We show that formulating the quantum time of arrival problem in a segment of the real line suggests rephrasing the quantum time of arrival problem to finding states that evolve to unitarily collapse at a given point at a definite time. For…
Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…
Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the…
The quantization of a single particle without spin in an appropriate curved space-time is considered. The Hamilton formalism on reduced space for a particle in a curved space-time is constructed and the main aspects of quantization scheme…
The well-known algorithm for quantum phase estimation requires that the considered unitary is available as a conditional transformation depending on the quantum state of an ancilla register. We present an algorithm converting an unknown…
The quantum mechanical expression relating two commuting operators is reformulated such that the power method (also called method of moments) for iteratively calculating eigenvalues and eigenvectors becomes applicable. The new iterative…
Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…
In our model a fixed Hamiltonian acts on the joint Hilbert space of a quantum system and its controller. We show under which conditions measurements, state preparations, and unitary implementations on the system can be performed by quantum…
Exactly solvable Hamiltonians are useful in the study of quantum many-body systems using quantum computers. In the variational quantum eigensolver, a decomposition of the target Hamiltonian into exactly solvable fragments can be used for…
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…
Grover's algorithm, a well-know quantum search algorithm, allows one to find the correct item in a database, with quadratic speedup. In this paper we adapt Grover's algorithm to the problem of finding a correct answer to a natural language…
We detail a quantum circuit capable of efficiently encoding analytical approximations to gravitational wave signal waveforms of compact binary coalescences into the amplitudes of quantum bits using both quantum arithmetic operations and…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Accurate computation of multiple eigenvalues of quantum Hamiltonians is essential in quantum chemistry, materials science, and molecular spectroscopy. Estimating excited-state energies is challenging for classical algorithms due to…
We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build…
Given a quantum Hamiltonian and its evolution time, the corresponding unitary evolution operator can be constructed in many different ways, corresponding to different trajectories between the desired end-points. A choice among these…
The Groverian entanglement measure, G(psi), is applied to characterize a variety of pure quantum states |psi> of multiple qubits. The Groverian measure is calculated analytically for certain states of high symmetry, while for arbitrary…