We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess universality of graph states, by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal non-graph state.
We show that both the classical as well as the quantum definitions of the Fisher information faithfully identify resourceful quantum states in general quantum resource theories, in the sense that they can always distinguish between states with and without a given resource. This shows that all quantum resources confer an advantage in metrology, and establishes the Fisher information as a universal tool to probe the resourcefulness of quantum states. We provide bounds on the extent of this advantage, as well as a simple criterion to test whether different resources are useful for the estimation …
We show that the quantum dimer state on the Kagome lattice, which was recently realized with high fidelity in a Rydberg quantum simulator [Semeghini et al., Science 374, 6572 (2021)], offers a sufficient resource for universal measurement-based quantum computations. In particular, we provide an efficient encoding of logical qubits in this state, and give explicit measurement sequences that implement a universal set of gates on these qubits. Since the building blocks of the proposed measurements have already been experimentally implemented, our work highlights one possible path towards promotin…
We derive a trade-off relation between the accuracy of implementing a desired unitary evolution using a restricted set of free unitaries and the size of the assisting system, in terms of the resource generating/losing capacity of the target unitary. In particular, this relation implies that, for any theory equipped with a resource measure satisfying lenient conditions, any resource changing unitary cannot be perfectly implemented by a free unitary applied to a system and an environment if the environment has finite dimensions. Our results are applicable to a wide class of resources including e…
Universal method for optimized robustness in self-testing of quantum resources
National Chung Hsing University（国立中兴大学）；National Center for Theoretical Sciences（国家理论科学中心）；National Cheng Kung University（国立成功大学）；Hamburg University of Technology（汉堡工业大学）；Technical University of Darmstadt（达姆施塔特工业大学）
The Gottesman-Kitaev-Preskill (GKP) quantum error-correcting code has emerged as a key technique in achieving fault-tolerant quantum computation using photonic systems. Whereas [Baragiola et al., Phys. Rev. Lett. 123, 200502 (2019)] showed that experimentally tractable Gaussian operations combined with preparing a GKP codeword $\lvert 0\rangle$ suffice to implement universal quantum computation, this implementation scheme involves a distillation of a logical magic state $\lvert H\rangle$ of the GKP code, which inevitably imposes a trade-off between implementation cost and fidelity. In contrast…
We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another, but some maps are deemed free. The free maps are supposed to satisfy certain axioms, among them closure under tensor products, under composition and freeness of the identity map (the latter two say that the free maps form a monoid). The free maps act on the resources simply by tensor product and composition. This generalizes the much-studied resource theorie…
Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the client's privacy. Generally, many-qubit entangled states are often used to complete BQC tasks. But for a large-scale entangled state, it is difficult to be described since its Hilbert space dimension is increasing exponentially. Furthermore, the number of entangled qubits is limited in experiment of existing works. To tackle this problem, in this paper we propose a universal BQC protocol based on me…
Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and fault-tolerance. Universality is the ability to execute arbitrary multi-input quantum algorithms. Scalability means that computational resources such as logical qubits can be increased without requiring exponential increase in physical resources. Lastly, fault-tolerance is the ability to perform quantum algorithms in presence of imperfections and noise. A promising appro…
Continuous-variable systems realized in quantum optics play a major role in quantum information processing, and it is also one of the promising candidates for a scalable quantum computer. We introduce a resource theory for continuous-variable systems relevant to universal quantum computation. In our theory, easily implementable operations---Gaussian operations combined with feed-forward---are chosen to be the free operations, making the convex hull of the Gaussian states the natural free states. Since our free operations and free states cannot perform universal quantum computation, genuine non…
Unified framework for bosonic quantum information encoding, resources and universality from superselection rules
Université Paris Cité（巴黎西岱大学）；CNRS（法国国家科学研究中心）；Laboratoire Matériaux et Phénomènes Quantiques（物质与现象量子实验室）；Département de Mathématiques et Applications de l’Ecole Normale Supérieure - PSL（巴黎高等师范学院-PSL数学与应用系）；Université Paris-Saclay（巴黎萨克雷大学）
No quantum circuit can turn a completely unknown unitary gate into its coherently controlled version. Yet, coherent control of unknown gates has been realised in experiments, making use of a different type of initial resources. Here, we formalise the task achieved by these experiments, extending it to the control of arbitrary noisy channels, and to more general types of control involving higher dimensional control systems. For the standard notion of coherent control, we identify the information-theoretic resource for controlling an arbitrary quantum channel on a $d$-dimensional system: specifi…
Universal quantum computation using photonic systems requires gates whose Hamiltonians are of order greater than quadratic in the quadrature operators. We first review previous proposals to implement such gates, where specific non-Gaussian states are used as resources in conjunction with entangling gates such as the continuous-variable versions of C-PHASE and C-NOT gates. We then propose ON states which are superpositions of the vacuum and the $N^{th}$ Fock state, for use as non-Gaussian resource states. We show that ON states can be used to implement the cubic and higher-order quadrature phas…
We provide the first example of a symmetry protected quantum phase that has universal computational power. Throughout this phase, which lives in spatial dimension two, the ground state is a universal resource for measurement based quantum computation.
We develop a resource theory for continuous-variable systems grounded on operations routinely available within current quantum technologies. In particular, the set of free operations is convex and includes quadratic transformations and conditional coarse-grained measurements. The present theory lends itself to quantify both quantum non-Gaussianity and Wigner negativity as resources, depending on the choice of the free-state set --- i.e., the convex hull of Gaussian states or the states with positive Wigner function, respectively. After showing that the theory admits no maximally resourceful st…
Universal quantum computation is usually associated with interaction among two-level quantum subsystems, as this interaction is commonly viewed as a necessity to achieve universal quantum computation. In this work, we show that, contrary to this intuition, universal quantum computation can be achieved without interaction among initially independent two-level quantum subsystems. We call it counterfactual universal quantum computation. As special cases, we show how to achieve counterfactual communication of quantum states, counterfactual quantum swapping, and counterfactual quantum erasure codes…
Entanglement and coherence are two essential quantum resources for quantum information processing. A natural question arises of whether there are direct link between them. And by thinking about this question, we propose a new measure for quantum state that contains concurrence and is called intrinsic concurrence. Interestingly, we discover that the intrinsic concurrence is always complementary to coherence. Note that the intrinsic concurrence is related to the concurrence of a special pure state ensemble. In order to explain the trade-off relation more intuitively, we apply it in some composit…
