Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Quantum teleportation
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Higher dimensions === Quantum teleportation can improve the errors associated with [[Quantum threshold theorem|fault tolerant quantum computation]] via an arrangement of logic gates. Experiments by D. Gottesman and I. L. Chuang have determined that a "Clifford hierarchy"<ref>{{Cite journal |last1=Gottesman |first1=Daniel |last2=Chuang |first2=Isaac L. |date=November 1999 |title=Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations |journal=Nature |language=en |volume=402 |issue=6760 |pages=390β393 |doi=10.1038/46503 |issn=0028-0836 |arxiv=quant-ph/9908010 |bibcode=1999Natur.402..390G |s2cid=4411647}}</ref> gate arrangement which acts to enhance protection against environmental errors. Overall, a higher threshold of error is allowed with the Clifford hierarchy as the sequence of gates requires less resources that are needed for computation. While the more gates that are used in a quantum computer create more noise, the gates arrangement and use of teleportation in logic transfer can reduce this noise as it calls for less "traffic" that is compiled in these quantum networks.<ref>{{cite journal |last1=Luo |first1=Yi-Han |last2=Chen |first2=Ming-cheng |last3=Erhard |first3=Manuel |last4=Zhong |first4=Han-Sen |last5=Wu |first5=Dian |last6=Tang |first6=Hao-Yang |last7=Zhao |first7=Qi |last8=Wang |first8=Xi-Lin |last9=Fujii |first9=Keisuke |last10=Li |first10=Li |last11=Liu |first11=Nai-Le |last12=Nemoto |first12=Kae |last13=Munro |first13=William |last14=Lu |first14=Chao-Yang |last15=Zeilinger |first15=Anton |last16=Pan |first16=Jian-Wei |date=7 September 2020 |title=Quantum teleportation of physical qubits into logical code-spaces |journal=PNAS |volume=118 |issue=36 |at=e2026250118 |arxiv=2009.06242 |doi=10.1073/pnas.2026250118 |pmid=34479998 |doi-access=free |pmc=8433538}}</ref> The more qubits used for a quantum computer, the more levels are added to a gate arrangement, with the diagonalization of gate arrangement varying in degree. Higher dimension analysis involves the higher level gate arrangement of the Clifford hierarchy.<ref>{{cite journal |author=de Silva |first=Nadish |year=2021 |title=Efficient quantum gate teleportation in higher dimensions |journal=Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences |volume=477 |issue=2251 |arxiv=2011.00127 |bibcode=2021RSPSA.47700865D |doi=10.1098/rspa.2020.0865 |s2cid=226227346}}</ref>
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Quantum teleportation
(section)
Add topic