We present a novel way to manipulate ultra-cold atoms where four atomic levels are trapped by appropriately tuned optical lattices. When employed to perform quantum computation via global control, this unique structure dramatically reduces the number of steps involved in the control procedures, either for the standard, network, model, or for one-way quantum computation. The use of a far-blue detuned lattice and a magnetically insensitive computational basis makes the scheme robust against decoherence. The present scheme is a promising candidate for experimental implementation of quantum computation and for graph state preparation in one, two or three spatial dimensions.
What resources are universal for quantum computation? In the standard model, a quantum computer consists of a sequence of unitary gates acting coherently on the qubits making up the computer. This paper shows that a very different model involving only projective measurements, quantum memory, and the ability to prepare the |0> state is also universal for quantum computation. In particular, no coherent unitary dynamics are involved in the computation.
We demonstrate an improved concatenated encoded ancilla preparation procedure. Simulations show that this procedure significantly increases the error threshold beneath which arbitrarily long quantum computations are possible.
Quantum state preparation plays an equally important role with quantum operations and measurements in quantum information processing. The previous methods of preparing initial state for bulk quantum computation all have inevitable disadvantages, such as, requiring multiple experiments, causing loss of signals, or requiring molecules with restrictive structure. In this work, three kinds of quantum circuits are introduced to prepare the pseudo-pure states of ($n-1$) qubits in the Hilbert space of $n$ coupled spins which merely need the assist of one ancilla spin and two experiments independent o…
All-optical addressing and control of single solid-state based qubits allows for scalable architectures of quantum devices such as quantum networks and quantum simulators. So far, all-optical addressing of qubits was demonstrated only for color centers in diamond and quantum dots. Here, we demonstrate generation of coherent dark state of a single rare earth ion in a solid, namely a cerium ion in yttrium aluminum garnet (YAG). The dark state was formed under the condition of coherent population trapping. Furthermore, high-resolution spectroscopic studies of native and implanted single Ce ions h…
Quantum computing is believed to be particularly useful for the simulation of chemistry and materials, among the various applications. In recent years, there have been significant advancements in the development of near-term quantum algorithms for quantum simulation, including VQE and many of its variants. However, for such algorithms to be useful, they need to overcome several critical barriers including the inability to prepare high-quality approximations of the ground state. Current challenges to state preparation, including barren plateaus and the high-dimensionality of the optimization la…
We consider the problem of minimizing resources required for universal quantum computation using only projective measurements. The resources we focus on are observables, which describe projective measurements, and ancillary qubits. We show that the set of observables {Z \otimes X, (cosθ)X + (sinθ)Y all θ\in [0, 2π)} with one ancillary qubit is universal for quantum computation. The set is simpler than a previous one in the sense that one-qubit projective measurements described by the observables in the set are ones only in the (X,Y) plane of the Bloch sphere. The proof of the universality imme…
The noisy binary linear problem (NBLP) is known as a computationally hard problem, and therefore, it offers primitives for post-quantum cryptography. An efficient quantum NBLP algorithm that exhibits a polynomial quantum sample and time complexities has recently been proposed. However, the algorithm requires a large number of samples to be loaded in a highly entangled state and it is unclear whether such a precondition on the quantum speedup can be obtained efficiently. Here, we present a complete analysis of the quantum solvability of the NBLP by considering the entire algorithm process, name…
The role played by quantum discord in mixed-state computation is widely debated since, in spite of evidence of its importance in creating quantum advantages, even in the absence of entanglement, there are not direct proofs of its necessity in these computational tasks. Recently the presence of discord was shown to be necessary and sufficient for remote state preparation for a broad class of quantum channels [B. Dakić et al., Nat. Phys. 8, 666 (2012)]. Here, we show that this property is not universal. There are states whose discord cannot be considered as a quantum resource, since it has been …
Cluster states, a special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot molecules, where qubits are encoded on singlet and triplet state of two coupled quantum dots. By applying a collective electrical field or simultaneously adjusting interdot bias voltages of all double-dot molecule, we get a switchable Ising-like interaction between any two adjacent quantum molecule qubits. The initialization, the single qubit measurement, and the ex…
Squeezed states of harmonic oscillators are a central resource for continuous-variable quantum sensing, computation and communication. Here we propose a method for the generation of very good approximations to highly squeezed vacuum states with low excess anti-squeezing using only a few oscillator-qubit coupling gates through a Rabi-type interaction Hamiltonian. This interaction can be implemented with several different methods, which has previously been demonstrated in superconducting circuit and trapped-ion platforms. The protocol is compatible with other protocols manipulating quantum harmo…
Arrays of neutral-atom qubits in optical tweezers are a promising platform for quantum computation. Despite experimental progress, a major roadblock for realizing neutral atom quantum computation is the qubit initialization. Here we propose that supersymmetry -- a theoretical framework developed in particle physics -- can be used for ultra-high fidelity initialization of neutral-atom qubits. We show that a single atom can be deterministically prepared in the vibrational ground state of an optical tweezer by adiabatically extracting all excited atoms to a supersymmetric auxiliary tweezer. The s…
Quantum error correction and fault-tolerant quantum computation are two fundamental concepts which make quantum computing feasible. While providing a theoretical means with which to ensure the arbitrary accuracy of any quantum circuit, fault-tolerant error correction is predicated upon the robust preparation of logical states. An optimal direct circuit and a more complex fault-tolerant circuit for the preparation of the [[7,1,3]] Steane logical-zero are simulated in the presence of discrete quantum errors to quantify the regime within which fault-tolerant preparation of logical states is prefe…
A scheme for globally addressing a quantum computer is presented along with its realisation in an optical lattice setup of one, two or three dimensions. The required resources are mainly those necessary for performing quantum simulations of spin systems with optical lattices, circumventing the necessity for single qubit addressing. We present the control procedures, in terms of laser manipulations, required to realise universal quantum computation. Error avoidance with the help of the quantum Zeno effect is presented and a scheme for globally addressed error correction is given. The latter doe…
Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparation and the measurement of quantum Turing machines is discussed. The local transition functions are characterized for fully general quantum Turing machines. A new halting protocol is proposed without augmenting the halting qubit and is shown to work without spoiling the computation.
We propose a single-site addressing implementation based on the sub-wavelength localization via adiabatic passage (SLAP) technique. We consider a sample of ultracold neutral atoms loaded into a two-dimensional optical lattice with one atom per site. Each atom is modeled by a three-level Λ-system in interaction with a pump and a Stokes laser pulse. Using a pump field with a node in its spatial profile, the atoms at all sites are transferred from one ground state of the system to the other via stimulated Raman adiabatic passage, except the one at the position of the node that remains in the init…
Numerical simulation of continuous variable quantum state preparation is a necessary tool for optimization of existing quantum information processing protocols. A powerful instrument for such simulation is the numerical computation in the Fock state representation. It unavoidably uses an approximation of the infinite-dimensional Fock space by finite complex vector spaces implementable with classical digital computers. In this approximation we analyze the accuracy of several currently available methods for computation of the truncated coherent displacement operator. To overcome their limitation…
Variational quantum eigensolver (VQE) is a promising algorithm suitable for near-term quantum machines. VQE aims to approximate the lowest eigenvalue of an exponentially sized matrix in polynomial time. It minimizes quantum resource requirements both by co-processing with a classical processor and by structuring computation into many subproblems. Each quantum subproblem involves a separate state preparation terminated by the measurement of one Pauli string. However, the number of such Pauli strings scales as $N^4$ for typical problems of interest--a daunting growth rate that poses a serious li…
Quantum state preparation is an important class of quantum algorithms that is employed as a black-box subroutine in many algorithms, or used by itself to generate arbitrary probability distributions. We present a novel state preparation method that utilizes less quantum computing resource than the existing methods. Two variants of the algorithm with different emphases are introduced. One variant uses fewer qubits and no controlled gates, while the other variant potentially requires fewer gates overall. A general analysis is given to estimate the number of qubits necessary to achieve a desired …
The preparation of ground states of spin systems is a fundamental operation in quantum computing and serves as the basis of adiabatic quantum computing. This form of quantum computation is subject to the adiabatic theorem which in turn poses a fundamental speed limit. We show that by employing diabatic transitions via counter diabatic driving a less strict requirement on adiabaticity applies. We demonstrate a scaling advantage from local and multi-spin counter diabatic driving in the ground-state fidelity compared to their adiabatic counterpart, for different Ising spin models.
Separate addressing of individual qubits is a challenging requirement for scalable quantum computation, and crosstalk between operations on neighboring qubits remains as a significant source of noise for current experimental implementation of multi-qubit platforms. We propose a scheme based on spatial refocusing from interference of several coherent laser beams to significantly reduce the crosstalk noise for any type of quantum gates. A general framework is developed for the spatial refocusing technique, in particular with practical Gaussian beams, and we show under typical experimental condit…
We introduce a protocol between a classical polynomial-time verifier and a quantum polynomial-time prover that allows the verifier to securely delegate to the prover the preparation of certain single-qubit quantum states. The protocol realizes the following functionality, with computational security: the verifier chooses one of the observables $Z$, $X$, $Y$, $(X+Y)/\sqrt{2}$, $(X-Y)/\sqrt{2}$; the prover receives a uniformly random eigenstate of the observable chosen by the verifier; the verifier receives a classical description of that state. The prover is unaware of which state he received a…
A fundamental prerequisite for the implementation of linear optical quantum computation is a source of single-photon wavepackets capable of high-visibility interference in scalable networks. These conditions can be met with micro-structured waveguides in conjunction with ultra-short classical timing pulses. By exploiting a novel type-II phasematching configuration we demonstrate a waveguided single photon source exhibiting a conditional detection efficiency exceeding 51% (which corresponds to a preparation efficiency of 85%) and extraordinarily high detection rates of up to 8.5x10^5 coincidenc…
The preparation of Gibbs thermal states is an important task in quantum computation with applications in quantum simulation, quantum optimization, and quantum machine learning. However, many algorithms for preparing Gibbs states rely on quantum subroutines which are difficult to implement on near-term hardware. Here, we address this by (i) introducing an objective function that, unlike the free energy, is easily measured, and (ii) using dynamically generated, problem-tailored ansätze. This allows for arbitrarily accurate Gibbs state preparation using low-depth circuits. To verify the effective…
The preparation of multipartite entangled states is the prerequisite for exploring quantum information networks and quantum computation. In this letter, we present the first experimental demonstration of eight-partite spatially separated CV entangled states. The initial resource quantum states are eight squeezed states of light, through the linearly optical transformation of which two types of the eight-partite cluster entangled states are prepared, respectively. The generated eight entangled photonic qumodes are spatially separated, which provide valuable quantum resources to implement more c…
Quantum computing has seen tremendous progress in the past years. Due to the implementation complexity and cost, the future path of quantum computation is strongly believed to delegate computational tasks to powerful quantum servers on cloud. Universal blind quantum computing (UBQC) provides the protocol for the secure delegation of arbitrary quantum computations, and it has received significant attention. However, a great challenge in UBQC is how to transmit quantum state over long distance securely and reliably. Here, we solve this challenge by proposing and demonstrating a resource-efficien…
Stabilizer states are extensively studied in quantum information theory for their structures based on the Pauli group. Calderbank-Shor-Steane (CSS) stabilizer states are of particular importance in their application to fault-tolerant quantum computation (FTQC). However, how to fault-tolerantly prepare arbitrary CSS stabilizer states for general CSS stabilizer codes is still unknown, and their preparation can be highly costly in computational resources. In this paper, we show how to prepare a large class of CSS stabilizer states useful for FTQC. We propose distillation protocols using syndrome …
Estimating the fidelity of state preparation in multi-qubit systems is generally a time-consuming task. Nevertheless, this complexity can be reduced if the desired state can be characterized by certain symmetries measurable with the corresponding experimental setup. In this paper we give simple expressions to estimate the fidelity of multi-qubit state preparation for rotational-invariant, stabilizer, and generalized coherent states. We specifically discuss the cat, W-type, and generalized coherent states, and obtain efficiently measurable lower bounds for the fidelity. We use these techniques …
The graph state formalism is a useful abstraction of entanglement. It is used in some multipartite purification schemes and it adequately represents universal resources for measurement-only quantum computation. We focus in this paper on the complexity of graph state preparation. We consider the number of ancillary qubits, the size of the primitive operators, and the duration of preparation. For each lexicographic order over these parameters we give upper and lower bounds for the complexity of graph state preparation. The first part motivates our work and introduces basic notions and notations …
Fault-tolerant quantum computation (FTQC) schemes that use multi-qubit large block codes can potentially reduce the resource overhead to a great extent. A major obstacle is the requirement of a large number of clean ancilla states of different types without correlated errors inside each block. These ancilla states are usually logical stabilizer states of the data code blocks, which are generally difficult to prepare if the code size is large. Previously we have proposed an ancilla distillation protocol for Calderbank-Shor-Steane (CSS) codes by classical error-correcting codes. It was assumed t…
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 eigenspaces of instantaneous Hamiltonians defined along an adiabatic schedule in order to prepare a ground state of a target problem Hamiltonian. We provide numerical evidence suggesting that, for combinatorial search problems, our algorithm can find a solution faster, on average, than Grover's search. We demonstrate our findings by applying both algorithms to solvi…
In quantum computation every unitary operation can be decomposed into quantum circuits-a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-NOT (CNOT) gates. Two measures are important when judging the complexity of the circuit: the total number of CNOT gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitr…
Robust quantum computation requires encoding delicate quantum information into degrees of freedom that are hard for the environment to change. Quantum encodings have been demonstrated in many physical systems by observing and correcting storage errors, but applications require not just storing information; we must accurately compute even with faulty operations. The theory of fault-tolerant quantum computing illuminates a way forward by providing a foundation and collection of techniques for limiting the spread of errors. Here we implement one of the smallest quantum codes in a five-qubit super…
We report on the numerically exact simulation of the dissipative dynamics governed by quantum master equations that feature fractional quantum Hall states as unique steady states. In particular, for the paradigmatic Hofstadter model, we show how Laughlin states can be to good approximation prepared in a dissipative fashion from arbitrary initial states by simply pumping strongly interacting bosons into the lowest Chern band of the corresponding single-particle spectrum. While pure (up to topological degeneracy) steady states are only reached in the low-flux limit or for extended hopping range,…
A scheme is presented for realizing a quantum phase gate with three-level atoms, solid-state qubits--often called artificial atoms, or ions that share a quantum data bus such as a single mode field in cavity QED system or a collective vibrational state of trapped ions. In this scheme, the conditional phase shift is tunable and controllable via the total effective interaction time. Furthermore, we show that the method can be used for effective preparation of graph-state entanglement, which are important resources for quantum computation, quantum error correction, studies of multiparticle entang…
Black-box quantum state preparation is a fundamental building block for many higher-level quantum algorithms, which is applied to transduce the data from computational basis into amplitude. Here we present a new algorithm for performing black-box state preparation with inverse coefficients based on the technique of inequality test. This algorithm can be used as a subroutine to perform the controlled rotation stage of the Harrow-Hassidim-Lloyd (HHL) algorithm and the associated matrix inversion algorithms with exceedingly low cost. Furthermore, we extend this approach to address the general bla…
We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower …
Fault-tolerant quantum computation using quantum error-correcting codes requires fault-tolerant constructions of nontransversal gates. Shor proposed a fault-tolerant construction of a nontransversal gate, i.e., the Toffoli gate for a family of the Calderbank-Shor-Steane codes which has even-weight stabilizer generators and odd-weight logical operators. In fact, as shown in this paper, error propagations in the ancilla preparation of Shor's construction lead to logical errors. This work provides a solution to this problem through the insertion of bit flip error correction. Finally, error rates …
Quantum computation promises an exponential speedup of certain classes of classical calculations through the preparation and manipulation of entangled quantum states. So far most molecular simulations on quantum computers, however, have been limited to small numbers of particles. Here we prepare a highly entangled state on a 53-qubit IBM quantum computer, representing 53 particles, which reveals the formation of an exciton condensate of photon particles and holes. While elusive for more than 50 years, such condensates were recently achieved for electron-hole pairs in graphene bilayers and meta…
Quantum entanglement is widely recognized as one of the key resources for the advantages of quantum information processing, including universal quantum computation, reduction of communication complexity or secret key distribution. However, computational models have been discovered, which consume very little or no entanglement and still can efficiently solve certain problems thought to be classically intractable. The existence of these models suggests that separable or weakly entangled states could be extremely useful tools for quantum information processing as they are much easier to prepare a…
