Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1307.4750 · Quantum Information Processing

On the role of the basis of measurement in quantum gate teleportation

F. V. Mendes, Rubens Viana Ramos

Published Apr 18, 2015• 3 citations
arXivHTMLPDF
DOI
10.1007/s11128-014-0898-4

Related papers

Measurement-based quantum gate teleportation and the degeneracy of the entanglement spectrum: beyond symmetry protected topological order

Zhuohao Liu, David L. Feder

Bulletin of the American Physical Society•Mar 19, 2021•0 citations

Quantum gate teleportation, universal entanglers and connections with the number teory

F. V. Mendes

The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of $mathbb{C}^{4}$ Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in $mathbb{C}^{3} otimes mathbb{C}^{4}$ and $mathbb{C}^{4} otimes mathbb{C}^{4}$ Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.

•Jan 1, 2015•0 citations

On construction of quantum teleportation measured by four orthogonal bases

Sho Yamauchi, Noboru Watanabe

IEICE Technical Report; IEICE Tech. Rep.•Jul 18, 2013•0 citations

Nonlocal Measurements and Teleportation of Quantum States

Lev Vaidman A

Springer eBooks•Jan 1, 1995•1 citation

Quantum Teleportation and Measurement-Based Quantum Computation

Warit Asavanant, Akira Furusawa

Quantum teleportation is the most basic quantum protocol that transfers quantum states between two parties via sharing of quantum entanglement, measurements, and feedforward operations. At first glance, quantum teleportation is simply an identity operation that does not change the quantum states. Quantum teleportation, however, forms the basis for a paradigm of quantum computation called measurement-based quantum computation (MBQC). In the first half of this chapter, we describe continuous-variable (CV) quantum teleportation. In the second half, we explain how to use quantum teleportation in MBQC. There are two important concepts regarding MBQC: cluster state and gate teleportation. Cluster state is a multipartite entangled state that can be used for CV quantum computation, given that we can implement appropriate measurements and feedforward operations on it. Gate teleportation, on the other hand, is a concept that we can “teleport” non-Gaussian operations on the resource state to the input state.

•Jan 25, 2022•0 citations

Magic Gate Teleportation: Structure, Useful Resource States, and Simpler Feedforward

Yunzhe Zheng, Allen Zang, Aleksander Kubica

Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of magic gate teleportation (MGT), a form of quantum gate teleportation that uses non-stabilizer resource states to implement non-Clifford unitary gates on arbitrary input states without revealing information about those states. This setting is motivated by the canonical approach to implementing logical non-Clifford gates in fault-tolerant quantum computation. We uncover a hidden structure within MGT---after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that directly useful single-qubit resource states are necessarily Clifford-equivalent to diagonal states, and establish the same constraint for multi-qubit resource states used in a broad class of MGT protocols. In particular, the output state distilled from the $[\![5, 1, 3]\!]$ protocol is not directly useful for any MGT protocols, though it can be probabilistically converted into directly useful states. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.

quant-pharXiv:2607.08508•Jul 10, 2026•1 citation
The present thesis can be divided in three parts: 1) Quantum gate teleportation; 2) Numerical search of universal entanglers; 3) Connections between quantum information and number theory. Regarding the quantum gate teleportation, a separability criterion of normal matrices is used to find the analytical conditions of the preservation of separability under conjugation. That analytical condition allowed to find the general formula of an element of mathbbC4mathbb{C}^{4}mathbbC4 Clifford group, as well to understand the role of the basis of measurement in the quantum gate teleportation protocol. Considering the searching for universal entanglers, the same separability criterion of normal matrices was used as fitness function in a computational heuristics, in prder to find good candidates for universal entanglers in mathbbC3otimesmathbbC4mathbb{C}^{3} otimes mathbb{C}^{4}mathbbC3otimesmathbbC4 and mathbbC4otimesmathbbC4mathbb{C}^{4} otimes mathbb{C}^{4}mathbbC4otimesmathbbC4 Hilbert spaces. At last, in the connection of quantum information with the number theory, it is presented the study of the preparation and entanglement of several multi-qubit quantum states based in integer sequences, and the Riemannian quantum circuit, a quantum circuit whose eigenvalues are related to the zeros of the Riemann zeta function. The existence of such circuit proves that is always possible to construct a physical system related to a finite amount of zeros.
Quantum teleportation is the most basic quantum protocol that transfers quantum states between two parties via sharing of quantum entanglement, measurements, and feedforward operations. At first glance, quantum teleportation is simply an identity operation that does not change the quantum states. Quantum teleportation, however, forms the basis for a paradigm of quantum computation called measurement-based quantum computation (MBQC). In the first half of this chapter, we describe continuous-variable (CV) quantum teleportation. In the second half, we explain how to use quantum teleportation in MBQC. There are two important concepts regarding MBQC: cluster state and gate teleportation. Cluster state is a multipartite entangled state that can be used for CV quantum computation, given that we can implement appropriate measurements and feedforward operations on it. Gate teleportation, on the other hand, is a concept that we can “teleport” non-Gaussian operations on the resource state to the input state.
Quantum gate teleportation is a key technique in fault-tolerant quantum computation that uses resource states to implement logical gates. Here, we develop a theory of magic gate teleportation (MGT), a form of quantum gate teleportation that uses non-stabilizer resource states to implement non-Clifford unitary gates on arbitrary input states without revealing information about those states. This setting is motivated by the canonical approach to implementing logical non-Clifford gates in fault-tolerant quantum computation. We uncover a hidden structure within MGT---after backpropagating the Pauli measurements, MGT protocols can be viewed as encoding the input state into a stabilizer code heralded by the measurement outcomes, followed by a logical non-Clifford gate. Using this structure, we construct MGT protocols for any resource state obtained by applying commuting Pauli rotations to a stabilizer state, and provide an efficient algorithm for synthesizing their circuit implementations. Conversely, we prove that directly useful single-qubit resource states are necessarily Clifford-equivalent to diagonal states, and establish the same constraint for multi-qubit resource states used in a broad class of MGT protocols. In particular, the output state distilled from the [ ⁣[5,1,3] ⁣][\![5, 1, 3]\!][[5,1,3]] protocol is not directly useful for any MGT protocols, though it can be probabilistically converted into directly useful states. Finally, we identify conditions under which the feedforward operators can be implemented by Pauli operators, shedding light on the paradigm of algorithmic fault tolerance and simplifying the feedforward operations needed for quantum computing.