Related papers: Approximate Sparse State Preparation with the Grov…
In quantum algorithms discovered so far for simulating scattering processes in quantum field theories, state preparation is the slowest step. We present a new algorithm for preparing particle states to use in simulation of Fermionic Quantum…
We propose to employ the amplification mechanism of Grover's search algorithm to efficiently prepare entangled states of an ensemble of qubits. The conditional change of sign employed in the algorithm can be implemented by the phase shift…
A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation in Grover's search algorithm can be used to construct a (less efficient) quantum search algorithm is cleared. The…
Optimizing high-degree of freedom robotic manipulators requires searching complex, high-dimensional configuration spaces, a task that is computationally challenging for classical methods. This paper introduces a quantum native framework…
The problems of quantum state preparation and matrix block-encoding are ubiquitous in quantum computing: they are crucial parts of various quantum algorithms for the purpose for initial state preparation as well as loading problem relevant…
We discuss how to build some partially entangled states of $n$ two-state quantum systems (qubits). The optimal partially entangled state with a high degree of symmetry is considered to be useful for overcoming a shot noise limit of Ramsey…
Quantum state preparation initializes the quantum registers and is essential for running quantum algorithms. Designing state preparation circuits that entangle qubits efficiently with fewer two-qubit gates enhances accuracy and alleviates…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…
Many-body ground state preparation is an important subroutine used in the simulation of physical systems. In this paper, we introduce a flexible and efficient framework for obtaining a state preparation circuit for a large class of…
Grover's search algorithm has attracted great attention due to its quadratic speedup over classical algorithms in unsorted database search problems. However, Grover's algorithm is inefficient in multi-target search problems, except in the…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
We show that iteration of a few ( $\sim N^{1/4}$) unitary steps of Grover's algorithm suffices to perfectly prepare a Dicke state of $N$ atoms in a cavity. We also show that a few subsequent Grover steps can be employed to generate GHZ and…
Many quantum states arising in algorithms and physical systems occupy only a small, structured subset of the exponentially large Hilbert space, yet standard quantum state tomography fails to exploit this structure. We present an efficient…
The landmark Grover algorithm for amplitude amplification serves as an essential subroutine in various type of quantum algorithms, with guaranteed quantum speedup in query complexity. However, there have been no proposal to realize the…
Quantum circuits for loading probability distributions into quantum states are essential subroutines in quantum algorithms used in physics, finance engineering, and machine learning. The ability to implement these with high accuracy in…
Preparation of a target quantum many-body state on quantum simulators is one of the significant steps in quantum science and technology. With a small number of qubits, a few quantum states, such as the Greenberger-Horne-Zeilinger state,…
In order to achieve fault-tolerant quantum computation, we need to repeat the following sequence of four steps: First, perform 1 or 2 qubit quantum gates (in parallel if possible). Second, do a syndrome measurement on a subset of the…
The initial state creation is a starting point of many quantum algorithms and usually is considered as a separate subroutine not included into the algorithm itself. There are many algorithms aimed on creation of special class of states. Our…
Grover's algorithm solves the unstructured search problem. Grover's algorithm can find the target state with certainty only if searching one out of four. Designing the deterministic search algorithm can avoid any repetition of the…
A quantum computer encodes information in quantum states and runs quantum algorithms to surpass the classical counterparts by exploiting quantum superposition and quantum correlation. Grover's quantum search algorithm is a typical quantum…