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 introduce a protocol capable of generating a general measurement operator for a mechanical resonator. The technique requires a qubit-resonator interaction and uses a coherent pulse to drive qubit transitions. This is followed by projective measurement of the qubit's energy, constraining the resonator in a state that depends on the pulse shape. The freedom to choose a pulse shape for the coherent drive enables an arbitrary position-basis measurement operator. Using this measurement operator, we outline a two pulse protocol that probabilistically generates a pure mechanical state with a desir…
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…
A scheme for the deterministic joint remote preparation of a four- qubit cluster-type state using only two Greenberger-Horne-Zeilinger (GHZ) states as quantum channels is presented. In this scheme, the first sender per- forms a two-qubit projective measurement according to the real coefficient of the desired state. Then, the other sender utilizes the measurement result and the complex coefficient to perform another projective measurement. To obtain the desired state, the receiver applies appropriate unitary operations to his/her own two qubits and two CNOT operations to the two ancillary ones.…
Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum states. However, the standard greedy algorithm, in general, cannot take the global maxima and instead becomes stuck on a local maxima. Based on the standard greedy algorithm, in this paper we propose a revised version to design dynamic pulses to realize universal quantum state preparation, i.e., preparing any arbitrary state from another arbitrary one. As applications, we implement this scheme to the universal preparation of single- a…
Accurate and efficient preparation of quantum state is a core issue in building a quantum computer. In this paper, we investigate how to prepare a certain single- or two-qubit target state from arbitrary initial states in semiconductor double quantum dots with the aid of deep reinforcement learning. Our method is based on the training of the network over numerous preparing tasks. The results show that once the network is well trained, it works for any initial states in the continuous Hilbert space. Thus repeated training for new preparation tasks is avoided. Our scheme outperforms the traditio…
We characterize the long-time projective behavior of the stochastic master equation describing a continuous, collective spin measurement of an atomic ensemble both analytically and numerically. By adding state based feedback, we show that it is possible to prepare highly entangled Dicke states deterministically.
We propose various protocols for joint remotely prepare a four-dimensional quantum state by using two- and three-particle four-dimensional entangled state as the quantum channel. The single- and two-particle generalized projective measurement and the appropriate unitary operation are needed in our protocols. It is shown that the receiver can reconstruct the unknown original state only if two senders collaborate with each other.
Universal compilation is a training process that compiles a trainable unitary into a target unitary and it serves vast potential applications from quantum dynamic simulations to optimal circuits with deep-compressing, device benchmarking, quantum error mitigation, and so on. Here, we propose a universal compilation-based variational algorithm for the preparation and tomography of quantum states in low-depth quantum circuits. We apply the Fubini-Study distance to be a trainable cost function under various gradient-based optimizers, including the quantum natural gradient approach. We evaluate th…
A theory is universal contextual if its prediction cannot be reproduced by an ontological model satisfying both preparation and measurement noncontextuality assumptions. In this report, we first generalize the logical proofs of quantum preparation and measurement contextuality for qubit system for any odd number of preparations and measurements. Based on the logical proof, we derive testable universally non-contextual inequalities violated by quantum theory. We then propose a class of two-party communication games and show that the average success probability of winning such games is solely li…
We provide an interesting two-party parity oblivious communication game whose success probability is solely determined by the Bell expression. The parity-oblivious condition in an operational quantum theory implies the preparation non-contextuality in an ontological model of it. We find that the aforementioned Bell expression has two upper bounds in an ontological model; the usual local bound and a non-trivial preparation non-contextual bound arising from the non-trivial parity-oblivious condition, which is smaller that the local bound. We first demonstrate the communication game when both Ali…
Harmonic oscillators count among the most fundamental quantum systems with important applications in molecular physics, nanoparticle trapping, and quantum information processing. Their equidistant energy level spacing is often a desired feature, but at the same time a challenge if the goal is to deterministically populate specific eigenstates. Here, we show how interference in the transition amplitudes in a bichromatic laser field can suppress the sequential climbing of harmonic oscillator states (Kapitza-Dirac blockade) and achieve selective excitation of energy eigenstates, Schrödinger cats …
Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit measurements, which are both sufficient and necessary. We present a method to partially collapse the $C_k$-hierarchy in the indirect construction of unitary gates [Gottesman and Chuang, Nature, {\bf 402} 309 (1999)], and apply the method to find discrete universal sets of 2-qubit measurements.
We introduce a procedure to generate supersinglets, the multipartite generalization of angular momentum singlet states. A supersinglet is defined as a total spin zero state consisting of $ N $ spin-$ j $ particles. They are highly entangled and have zero spin variance in any direction, and as such are potentially useful for quantum metrology. Our scheme is based on projective measurements that measure the collective spin of the whole spin ensemble. A local unitary rotation is applied conditionally on the measurement outcome, such as to maximize the probability of obtaining spin zero on the sub…
State preparation and measurement errors are commonly regarded as indistinguishable. The problem of distinguishing state preparation (SPAM) errors from measurement errors is important to the field of characterizing quantum processors. In this work, we propose a method to separately characterize SPAM errors using a novel type of algorithmic cooling protocol called measurement-based algorithmic cooling (MBAC). MBAC assumes the ability to perform (potentially imperfect) projective measurements on individual qubits, which is available on many modern quantum processors. We demonstrate that MBAC can…
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…
In this letter, we propose and experimentally test a quantumness criterion for single systems. The criterion is based on the violation of an already reported classical inequality. This inequality is expressed in terms of joint probabilities that we identify as realizations of preparation-and-measurement schemes. Our analysis points out that superposition is the key notion to grasp the quantum nature of physical systems. We verify our criterion in an all-optical experimental setup with heralded single photons generated via spontaneous parametric down conversion and use exclusively projective pr…
The amount of information transferred during standard quantum teleportation or remote state preparation is equal to the preparation information of the transmitted state, rather than the classical communication required by respective protocol. This is shown by noting that the information required to specify the operation that verifies the transmitted state is identical to the preparation information, at the given level of precision m (in bits). Depending on the resolution of the projective Hilbert space, the preparation information can be made arbitrarily precise and hence indefinitely larger t…
We present a finite set of projective measurements that, together with quantum memory and preparation of the |0> state, suffice for universal quantum computation. This extends work of Nielsen [quant-ph/0108020], who proposed a scheme in which an arbitrary unitary operation on n qubits can be simulated using only projective measurements on at most 2n qubits. All measurements in our set involve two qubits, except two measurements which involve three qubits. Thus we improve by one the upper bound, implied by Nielsen's results, on the maximum number of qubits needed to participate in any single me…
In recent years there has been a significant development of the dynamical map formalism for initially correlated states of a system and its environment. Based on some of these results, we study quantum process tomography for initially correlated states of the system and the environment. This is beyond the usual assumption that the state of the system and the environment are initially uncorrelated. Since quantum process tomography is an experimental procedure, we wind up having to study the role of preparation of input states for open quantum experiments. We work out a theory for the general pr…
Optimal quantum machines can be implemented by linear projective operations. In the present work a general qubit symmetrization theory is presented by investigating the close links to the qubit purification process and to the programmable teleportation of any generic optimal anti-unitary map. In addition, the contextual realization of the N ->M cloning map and of the teleportation of the N->(M-N) universal NOT gate is analyzed by a novel and very general angular momentum theory. An extended set of experimental realizations by state symmetrization linear optical procedures is reported. These in…
In [Phys. Rev. Lett. 114, 250401 (2015)] the sharing of non-locality by multiple observers was demonstrated through the quantum violation of Clauser-Horne-Shimony-Halt inequality. In this paper we provide a scheme for sharing of non-locality and non-trivial preparation contextuality sequentially through the quantum violation of a family of Bell's inequalities where Alice and Bob perform $2^{n-1}$ and $n$ numbers of measurements of dichotomic observables respectively. For this, we consider that Alice always performs projective measurement and multiple Bobs sequentially perform unsharp measureme…
We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires no special ancillary state preparation to achieve universality, as opposed to schemes such as magic state distillation. The concatenation scheme exploits the transversal properties of two different codes, combining them to provide a means to protect against low-weight arbitrary errors. We give the required properties of the error correcting codes to ensure …
Multi-party entangled states have important applications in quantum metrology and quantum computation. Experimental preparation of large entangled state, in particular, the NOON states, however, remains challenging as the particle number $N$ increases. Here we develop a deterministic method to generate arbitrarily high NOON states for phonons and experimentally create the states up to $N=9$ phonons in two radial modes of a single trapped \Yb ion. We demonstrate that the fidelity of the NOON states are significantly above the classical limit by measuring the interference contrast and the popula…
Universal linear manipulation via routing and projective measurements
University of Trento（特伦托大学）；Istituto Nazionale di Fisica Nucleare - Trento Institute for Fundamental Physics and Applications (INFN-TIFPA)（意大利国家核物理研究所 - 特伦托基础物理与应用研究所）
We present a universal algorithm for an efficient deterministic preparation of an arbitrary two--mode bosonic state. In particular, we discuss in detail preparation of entangled states of a two-dimensional vibrational motion of a trapped ion via a sequence of laser stimulated Raman transitions. Our formalism can be generalized for multi-mode bosonic fields. We examine stability of our algorithm with respect to a technical noise.
Remote state preparation (RSP) provides a useful way of transferring quantum information between two distant nodes based on the previously shared entanglement. In this paper, we study RSP of an arbitrary single-photon state in two degrees of freedom (DoFs). Using hyper-entanglement as a shared resource, our first goal is to remotely prepare the single-photon state in polarization and frequency DoFs and the second one is to reconstruct the single-photon state in polarization and time-bin DoFs. In the RSP process, the sender will rotate the quantum state in each DoF of the photon according to th…
SuperEncoder: Towards Universal Neural Approximate Quantum State Preparation
Capital Normal University（首都师范大学）；Beijing University of Posts and Telecommunications（北京邮电大学）；University of Electronic Science and Technology of China（电子科技大学）
We investigate which quantum states can serve as universal resources for approximate and stochastic measurement-based quantum computation, in the sense that any quantum state can be generated from a given resource by means of single-qubit (local) operations assisted by classical communication. More precisely, we consider the approximate and stochastic generation of states, resulting e.g. from a restriction to finite measurement settings or from possible imperfections in the resources or local operations. We show that entanglement-based criteria for universality obtained for the exact, determin…
Quantum Cognition has delivered a number of models for semantic memory, but to date these have tended to assume pure states and projective measurement. Here we relax these assumptions. A quantum inspired model of human word association experiments will be extended using a density matrix representation of human memory and a POVM based upon non-ideal measurements. Our formulation allows for a consideration of key terms like measurement and contextuality within a rigorous modern approach. This approach both provides new conceptual advances and suggests new experimental protocols.
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 …
We demonstrate the feasibility of ground state preparation for the transverse Ising model using projective cooling, and show that the algorithm can effectively construct the ground state in the disordered (paramagnetic) phase. On the other hand, significant temperature effects are encountered in the ordered (ferromagnetic) phase requiring larger lattices to accurately simulate.
The hitherto unexplored nonlocality of quantum correlations in the information transfer protocol of remote state preparation (RSP) is investigated in terms of a unified nonlocality argument formulated for teleportation as well as for two distinct RSP schemes. The argument differs only in the respective types of local measurements used in each scenario. One of the RSP schemes uses single particle projective measurements, while the other uses joint Bell-basis measurements. Interestingly, the quantum mechanical violations of the Bell-CHSH type inequalities formulated for each of the RSP setups, w…
A projective measurement of energy (PME) on a quantum system is a quantum measurement, determined by the Hamiltonian of the system. PME protocols exist when the Hamiltonian is given in advance. Unknown Hamiltonians can be identified by quantum tomography, but the time cost to achieve a given accuracy increases exponentially with the size of the quantum system. In this letter, we improve the time cost by adapting quantum phase estimation, an algorithm designed for computational problems, to measurements on physical systems. We present a PME protocol without quantum tomography for Hamiltonians w…
Quantum measurement is universal for quantum computation. Two models for performing measurement-based quantum computation exist: the one-way quantum computer was introduced by Briegel and Raussendorf, and quantum computation via projective measurements only by Nielsen. The more recent development of this second model is based on state transfers instead of teleportation. From this development, a finite but approximate quantum universal family of observables is exhibited, which includes only one two-qubit observable, while others are one-qubit observables. In this article, an infinite but exact …
Transmission efficiency (TE) of remote state preparation (RSP) with a shared quantum state and one bit of classical communication is considered. Following [B. Daki et al., Nat. Phys. 8, 666 (2012)], the encoding and decoding strategies of the protocol are restricted to the physically relevant classes of projective measurements and unitary operators, respectively. It is shown that contrary to the previous arguments, the quadratic fidelity as well as the linear fidelity could be a valid figure of merit to quantify the TE of RSP. Then, the TE of the protocol in terms of both linear and quadratic …
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…
We consider the problem of certification of arbitrary ensembles of pure states and projective measurements solely from the experimental statistics in the prepare-and-measure scenario assuming the upper bound on the dimension of the Hilbert space. To this aim, we propose a universal and intuitive scheme based on establishing perfect correlations between target states and suitably-chosen projective measurements. The method works in all finite dimensions and allows for robust certification of the overlaps between arbitrary preparation states and between the corresponding measurement operators. Fi…
Polyatomic molecular ions contain many desirable attributes of a useful quantum system, including rich internal degrees of freedom and highly controllable coupling to the environment. To date, the vast majority of state-specific experimental work on molecular ions has concentrated on diatomic species. The ability to prepare and readout polyatomic molecules in single quantum states would enable diverse experimental avenues not available with diatomics, including new applications in precision measurement, sensitive chemical and chiral analysis at the single molecule level, and precise studies of…
We propose to use a cryogenic nonlinear resonator for the projective readout, classical memory, and feedback for a superconducting qubit. This approach sidesteps many of the inefficiencies inherent in two-way communication between temperature stages in typical systems with room temperature controllers, and avoids increasing the cryogenic heat load. This controller may find a broad range of uses in multi-qubit systems, but here we analyze two specific demonstrative cases in single qubit-control. In the first case, the nonlinear controller is used to initialize the qubit in a definite eigenstate…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.
A controlled evolution generated by nonlinear interactions is required to perform full manipulation of a quantum system, and such control is only coherent when the rate of nonlinearity is large compared to the rate of decoherence. As a result, engineered quantum systems typically rely on a bare nonlinearity much stronger than all decoherence rates, and this hierarchy is usually assumed to be necessary. In this work, we challenge this assumption by demonstrating the universal control of a quantum system where the relevant rate of bare nonlinear interaction is comparable to the fastest rate of d…
We propose quantum algorithms for projective ground-state preparation and calculations of the many-body Green's functions directly in frequency domain. The algorithms are based on the linear combination of unitary (LCU) operations and essentially only use quantum resources. To prepare the ground state, we construct the operator ${\exp}(-τ\hat{H}^2)$ using Hubbard-Stratonovich transformation by LCU and apply it on an easy-to-prepare initial state. Our projective state preparation procedure saturates the near-optimal scaling, $\mathcal{O}(\frac{1}{γΔ} \log \frac{1}{γη})$, of other currently know…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for studying various applications. Here, we present time-multiplexed finite quantum walks of variable size, the preparation of non-localized input states and their dynamical evolution. As a further application, we implement a state transfer scheme for an arbitrary input state to two different output modes. The presented experiments rely on the full dynamical cont…
Quantum measurement is universal for quantum computation. This universality allows alternative schemes to the traditional three-step organisation of quantum computation: initial state preparation, unitary transformation, measurement. In order to formalize these other forms of computation, while pointing out the role and the necessity of classical control in measurement-based computation, and for establishing a new upper bound of the minimal resources needed to quantum universality, a formal model is introduced by means of Measurement-based Quantum Turing Machines.
