No Arabic abstract
The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and nearly diagonal semi-Clifford gates are particularly important: they admit efficient gate teleportation protocols that implement these gates with fewer ancillary quantum resources such as magic states. Despite the practical importance of these sets of gates, many questions about their structure remain open; this is especially true in the higher-dimensional qudit setting. Our contribution is to leverage the discrete Stone-von Neumann theorem and the symplectic formalism of qudit stabiliser mechanics towards extending results of Zeng-Cheng-Chuang (2008) and Beigi-Shor (2010) to higher dimensions in a uniform manner. We further give a simple algorithm for recursively enumerating all gates of the Clifford hierarchy, a simple algorithm for recognising and diagonalising semi-Clifford gates, and a concise proof of the classification of the diagonal Clifford hierarchy gates due to Cui-Gottesman-Krishna (2016) for the single-qudit case. We generalise the efficient gate teleportation protocols of semi-Clifford gates to the qudit setting and prove that every third level gate of one qudit (of any prime dimension) and of two qutrits can be implemented efficiently. Numerical evidence gathered via the aforementioned algorithms support the conjecture that higher-level gates can be implemented efficiently.
Precise measurement or perfect cloning of unknown quantum states is forbidden by the laws of quantum mechanics. Yet, quantum teleportation in principle allows for a faithful and disembodied transmission of unknown quantum states between distant quantum systems using entanglement. There have been numerous experiments on teleportation of quantum states of single photons, atoms, trapped ions, defects in solid states, and superconducting circuits. However, all demonstrations to date were limited to a two-dimensional subspace$-$so-called qubit$-$of the quantized multiple levels of the quantum systems. In general, a quantum particle can naturally possess not only multiple degrees of freedom, but also, many degrees of freedom can have high quantum number beyond the simplified two-level subspace. Here, making use of multiport beam-splitters and ancillary single photons, we propose a resource-efficient and extendable scheme for teleportation of arbitrarily high-dimensional photonic quantum states. We report the first experimental teleportation of a qutrit, which is equivalent to a spin-1 system. Measurements over a complete set of 12 states in mutually unbiased bases yield a teleportation fidelity of 0.75(1), well above the optimal single-copy qutrit-state-estimation limit of 1/2. The fidelity also exceeds the limit of 2/3, the maximum possible for explanation through qubits only. Thus, we strictly prove a genuine three-dimensional, universal, and highly non-classical quantum teleportation. Combining previous methods of teleportation of two-particle composite states and multiple degrees of freedom, our work provides a complete toolbox for teleporting a quantum particle intact. We expect that our results will pave the way for quantum technology applications in high dimensions, since teleportation plays a central role in quantum repeaters and quantum networks.
I generalize the concept of balancedness to qudits with arbitrary dimension $d$. It is an extension of the concept of balancedness in New J. Phys. {bf 12}, 075025 (2010) [1]. At first, I define maximally entangled states as being the stochastic states (with local reduced density matrices $id/d$ for a $d$-dimensional local Hilbert space) that are not product states and show that every so-defined maximal genuinely multi-qudit entangled state is balanced. Furthermore, all irreducibly balanced states are genuinely multi-qudit entangled and are locally equivalent with respect to $SL(d)$ transformations (i.e. the local filtering transformations (LFO)) to a maximally entangled state. In particular the concept given here gives the maximal genuinely multi-qudit entangled states for general local Hilbert space dimension $d$. All genuinely multi-qudit entangled states are an element of the partly balanced $SU(d)$-orbits.
Teleportation is a quantum information processes without classical counterparts, in which the sender can disembodied transfer unknown quantum states to the receiver. In probabilistic teleportation through a partial entangled quantum channel, the transmission is exact (with fidelity 1), but may fail in a probability and simultaneously destroy the state to be teleported. We propose a scheme for nondestructive probabilistic teleportation of high-dimensional quantum states. With the aid of an ancilla in the hands of sender, the initial quantum information can be recovered when teleportation fails. The ancilla acts as a quantum apparatus to measure the senders subsystem, and erasing the information it records can resumes the initial state.
Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the clients private information. For example, measurement-based model can guarantee privacy of clients inputs, quantum algorithms and outputs. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. Specifically, in this paper we consider a scenario where there are a trusted center responsible for preparing initial states, a client with the ability to perform X, Z, and two non-communicating servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC ensures that all quantum outputs are at the clients side and the client only needs to detect whether servers honestly return correct measurement outcomes or not. In particular, GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. Also, GTUBQC protocol can facilitate realizing UBQC in circuits, since GTUBQC uses one-time-pad to guarantee blindness. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.
We describe a five-dimensional analogue of Wigners operator equation ${mathbb W}_a = lambda P_a$, where ${mathbb W}_a $ is the Pauli-Lubanski vector, $P_a$ the energy-momentum operator, and $lambda$ the helicity of a massless particle. Higher dimensional generalisations are also given.