Related papers: Fast Black-Box Quantum State Preparation Based on …
Quantum algorithm, as compared to classical algorithm, plays a notable role in solving linear systems of equations with an exponential speedup. Here, we demonstrate a method for solving a particular system of equations by using the concept…
Quantum computing draws huge attention due to its faster computational capability compared to classical computing to represent and compress the classical image data into the quantum domain. The main idea of quantum domain representation is…
We report the first use of "logical labeling" to perform a quantum computation with a room-temperature bulk system. This method entails the selection of a subsystem which behaves as if it were at zero temperature - except for a decrease in…
We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces…
Quantum compilation is the process of decomposing high-level quantum algorithms or arbitrary unitary operations into quantum circuits composed of a specific set of quantum gates. Neutral atom quantum computing platform is a quantum…
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and the fidelity of gates high enough that it can be…
Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and…
The matrix logarithm is one of the important matrix functions. Recently, a quantum algorithm that computes the state $|f\rangle$ corresponding to matrix-vector product $f(A)b$ is proposed in [Takahira, et al. Quantum algorithm for matrix…
Single photons, manipulated using integrated linear optics, constitute a promising platform for universal quantum computation. A series of increasingly efficient proposals have shown linear-optical quantum computing to be formally scalable.…
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework…
We explore the application of quantum optimal control (QOC) techniques to state preparation of lattice field theories on quantum computers. As a first example, we focus on the Schwinger model, quantum electrodynamics in 1+1 dimensions. We…
Real-world applications of computing can be extremely time-sensitive. It would be valuable if we could accelerate such tasks by performing some of the work ahead of time. Motivated by this, we propose a cost model for quantum algorithms…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate…
We propose a new approach to utilize quantum computers for binary linear programming (BLP), which can be extended to general integer linear programs (ILP). Quantum optimization algorithms, hybrid or quantum-only, are currently general…
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…
Solving linear systems is of great importance in numerous fields. Proposed quantum algorithms for preparing solutions for linear systems include the HHL algorithm with subsequent refinements and variational methods. Circulant linear systems…
State preparation protocols ideally require as minimal operations as possible, in order to be implemented in near-term, potentially noisy quantum devices. Motivated by long range interactions (LRIs) intrinsic to many present-day…
Using the properties of quantum superposition, we propose a quantum classification algorithm to efficiently perform multi-class classification tasks, where the training data are loaded into parameterized operators which are applied to the…
An alternative quantum algorithm for the discrete logarithm problem is presented. The algorithm uses two quantum registers and two Fourier transforms whereas Shor's algorithm requires three registers and four Fourier transforms. A crucial…