Related papers: Deterministic carving of quantum states with Grove…
The scalable preparation of large photon-number (Fock) states is a long-standing frontier in quantum science, with direct implications for quantum metrology and bosonic quantum information processing. Despite substantial progress at small…
We introduce a hybrid machine-learning algorithm for designing quantum optics experiments that produce specific quantum states. Our algorithm successfully found experimental schemes to produce all 5 states we asked it to, including…
We present a scheme for the deterministic generation of N-photon Fock states from N three-level atoms in a high-finesse optical cavity. The method applies an external laser pulsethat generates an $N$-photon output state while adiabatically…
We present a general algorithm to achieve local operators which can produce the GHZ state for an arbitrary given three-qubit state. Thus the distillation process of the state can be realized optimally. The algorithm is shown to be…
Quantum repeaters are nodes in a quantum communication network that allow reliable transmission of entanglement over large distances. It was recently shown that highly entangled photons in so-called graph states can be used for all-photonic…
We present a scheme to prepare a quantum state in a ion trap with probability approaching to one by means of ion trap quantum computing and Grover's quantum search algorithm acting on trapped ions.
Grover's quantum search algorithm evolves a quantum system from a known source state $|s\rangle$ to an unknown target state $|t\rangle$ using the selective phase inversions, $I_{s}$ and $I_{t}$, of these two states. In one of the…
Grover's algorithm, orginally conceived as a means of searching an unordered database, can also be used to extract solutions from the result sets generated by quantum computations. The Grover algorithm exploits the concept of an oracle…
We present an efficient algorithm for generating unitary maps on a $d$-dimensional Hilbert space from a time-dependent Hamiltonian through a combination of stochastic searches and geometric construction. The protocol is based on the…
By allowing measurements of observables other than the state of the qubits in a quantum computer, one can find eigenvectors very quickly. If a unitary operation U is implemented as a time-independent Hamiltonian, for instance, one can…
We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from…
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…
Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked…
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design.…
Spin systems such as silicon or nitrogen vacancy centers in diamond, quantum dots and quantum dot molecules coupled to optical cavities appear as key elements for creating quantum networks as not only constituting the nodes of the network,…
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…
The exact number of CNOT and single qubit gates needed to implement a Quantum Algorithm in a given architecture is one of the central problems of Quantum Computation. In this work we study the importance of concise realizations of Partially…
We investigate Riemannian gradient flows for preparing ground states of a desired Hamiltonian on a quantum device. We show that the number of steps of the corresponding Riemannian gradient descent (RGD) algorithm that prepares a ground…
Grover's search algorithm is one of the first quantum algorithms to exhibit a provable quantum advantage. It forms the backbone of numerous quantum applications and is widely used in benchmarking efforts. Here, we report…
All-photonic quantum repeater is not yet commercially applicable due to difficulty in the generation of repeater graph states (RGS) and the probabilistic nature of Bell-state measurement. In recent years, several deterministic protocols…