Related papers: Deterministic carving of quantum states with Grove…
Verifying the proper preparation of quantum states is essential in modern quantum information science. Various protocols have been developed to estimate the fidelity of quantum states produced by different parties. Direct fidelity…
We present a deterministic scheme for generating large-scale atomic W states in cavity QED system via a simple expansion mechanism, which is realized only by a detuned interaction between two identical atoms and a vacuum cavity mode. With…
We present an algorithm utilizing mid-circuit measurement and feedback that prepares Dicke states with polylogarithmically many ancillas and polylogarithmic depth. Our algorithm uses only global mid-circuit projective measurements and…
Schemes to generate Greenberger-Horne-Zeilinger(GHZ) and W states of three distant atoms are proposed in this paper. The schemes use the effects of quantum statistics of indistinguishable photons emitted by the atoms inside optical…
We experimentally explore the state space of three qubits on an NMR quantum information processor. We construct a scheme to experimentally realize a canonical form for general three-qubit states up to single-qubit unitaries. This form…
While dissipation is widely considered as being harmful for quantum coherence, it can, when properly engineered, lead to the stabilization of non-trivial pure quantum states. We propose a scheme for continuous generation and stabilization…
We propose a simple interaction protocol to be implemented on a scalable quantum network, in which the quantum nodes consist of qubit systems confined in cavities. The nodes are deterministically coupled by transmission and reflection of a…
Searching large databases is an important problem with broad applications. The Grover search algorithm provides a powerful method for quantum computers to perform searches with a quadratic speedup in the number of required database queries…
The ability to apply user-chosen large-scale unitary operations with high fidelity to a quantum state is key to realizing future photonic quantum technologies. Here, we realize the implementation of programmable unitary operations on up to…
Some of the secret sharing schemes having unique quantum features like parallelism and entanglement are supposed to be relatively secure. Different schemes proposed by various researchers over the years have features which could be specific…
An SO(3) picture of the generalized Grover's quantum searching algorithm,with arbitrary unitary transformation and with arbitrary phase rotations, is constructed. In this picture, any quantum search operation is a rotation in a 3…
The cubic phase state constitutes a nonlinear resource that is essential for universal quantum computing protocols. However, constructing such non-classical states faces many challenges. In this work, we present a protocol for generating a…
We solve a problem, which while not fitting into the usual paradigm, can be viewed as a quantum computation. Suppose we are given a quantum system described by an N dimensional Hilbert space with a Hamiltonian of the form $E |w >< w|$ where…
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem…
We present a deterministic protocol for the preparation of entangled states in the symmetric Dicke subspace of $N$ spins coupled to a common cavity mode that prepares entangled states useful for quantum sensing, achieving a precision…
The state of a microscopic system encodes its complete quantum description, from which the probabilities of all measurement outcomes are inferred. Being a statistical concept, the state cannot be obtained from a single system realization.…
A particular type of linear optical multiport, the Grover four-port, has previously been shown to couple the spatial symmetry of a photon to its direction of travel. It is shown here that use of a nonstandard choice of qubit, based on…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a…
Loading classical data into quantum computers represents an essential stage in many relevant quantum algorithms, especially in the field of quantum machine learning. Therefore, the inefficiency of this loading process means a major…