Hypothetical fault-tolerant quantum computer based on topological condensed matter

A topological quantum computer is a theoretical quantum computer that employs two-dimensional quasiparticles called anyons, whose world lines pass around one another to form braids in a three-dimensional spacetime (i.e., one temporal plus two spatial dimensions). These braids form the logic gates that make up the computer. The advantage of a quantum computer based on quantum braids over using trapped quantum particles is that the former is much more stable. Small, cumulative perturbations can cause quantum states to decohere and introduce errors in the computation, but such small perturbations do not change the braids' topological properties. This is like the effort required to cut a string and reattach the ends to form a different braid, as opposed to a ball (representing an ordinary quantum particle in four-dimensional spacetime) bumping into a wall. Alexei Kitaev proposed topological quantum computation in 1997. While the elements of a topological quantum computer originate in a purely mathematical realm, experiments in fractional quantum Hall systems indicate these elements may be created in the real world using semiconductors made of gallium arsenide at a temperature of near absolute zero and subjected to strong magnetic fields.

Anyons are quasiparticles in a two-dimensional space. Anyons are neither fermions nor bosons, but like fermions, they cannot occupy the same state. Thus, the world lines of two anyons cannot intersect or merge, which allows their paths to form stable braids in space-time. Anyons can form from excitations in a cold, two-dimensional electron gas in a very strong magnetic field, and carry fractional units of magnetic flux. This phenomenon is called the fractional quantum Hall effect. In typical laboratory systems, the electron gas occupies a thin semiconducting layer sandwiched between layers of aluminium gallium arsenide.

When anyons are braided, the transformation of the quantum state of the system depends only on the topological class of the anyons' trajectories (which are classified according to the braid group). Therefore, the quantum information which is stored in the state of the system is impervious to small errors in the trajectories. In 2005, Sankar Das Sarma, Michael Freedman, and Chetan Nayak proposed a quantum Hall device that would realize a topological qubit. In a key development for topological quantum computers, in 2005 Vladimir J. Goldman, Fernando E. Camino, and Wei Zhou claimed to have created and observed the first experimental evidence for using a fractional quantum Hall effect to create actual anyons, although others have suggested their results could be the product of phenomena not involving anyons. It should also be noted that non-abelian anyons, a species required for topological quantum computers, have yet to be experimentally confirmed. Possible experimental evidence has been found,[1] but the conclusions remain contested.[2]

Topological quantum computers are equivalent in computational power to other standard models of quantum computation, in particular to the quantum circuit model and to the quantum Turing machine model[citation needed]. That is, any of these models can efficiently simulate any of the others. Nonetheless, certain algorithms may be a more natural fit to the topological quantum computer model. For example, algorithms for evaluating the Jones polynomial were first developed in the topological model, and only later converted and extended in the standard quantum circuit model.

To live up to its name, a topological quantum computer must provide the unique computation properties promised by a conventional quantum computer design, which uses trapped quantum particles. Fortunately in 2002, Michael H. Freedman, Alexei Kitaev, Michael J. Larsen, and Zhenghan Wang proved that a topological quantum computer can, in principle, perform any computation that a conventional quantum computer can do.[3]

They found that a conventional quantum computer device, given an error-free operation of its logic circuits, will give a solution with an absolute level of accuracy, whereas a topological quantum computing device with flawless operation will give the solution with only a finite level of accuracy. However, any level of precision for the answer can be obtained by adding more braid twists (logic circuits) to the topological quantum computer, in a simple linear relationship. In other words, a reasonable increase in elements (braid twists) can achieve a high degree of accuracy in the answer. Actual computation [gates] are done by the edge states of a fractional quantum Hall effect. This makes models of one-dimensional anyons important. In one space dimension, anyons are defined algebraically.

Even though quantum braids are inherently more stable than trapped quantum particles, there is still a need to control for error inducing thermal fluctuations, which produce random stray pairs of anyons which interfere with adjoining braids. Controlling these errors is simply a matter of separating the anyons to a distance where the rate of interfering strays drops to near zero. Simulating the dynamics of a topological quantum computer may be a promising method of implementing fault-tolerant quantum computation even with a standard quantum information processing scheme. Raussendorf, Harrington, and Goyal have studied one model, with promising simulation results.[4]

One of the prominent examples in topological quantum computing is with a system of fibonacci anyons.[5] These anyons can be used to create generic gates for topological quantum computing. There are three main steps for creating a model:

Fibonacci Anyons are defined by three qualities:

The last fusion rule can be extended this to a system of three anyons:

Thus, fusing three anyons will yield a final state of total charge {displaystyle tau } in 2 ways, or a charge of 1 {displaystyle 1} in exactly one way. We use three states to define our basis.[6] However, because we wish to encode these three anyon states as superpositions of 0 and 1, we need to limit the basis to a two-dimensional Hilbert Space. Thus, we consider only two states with a total charge of {displaystyle tau } . This choice is purely phenomenological. In these states, we group the two leftmost anyons into a 'control group', and leave the rightmost as a 'non-computational anyon'. We classify a | 0 {displaystyle |0rangle } state as one where the control group has total 'fused' charge of 1 {displaystyle 1} , and a state of | 1 {displaystyle |1rangle } has a control group with a total 'fused' charge of {displaystyle tau } . For a more complete description, see Nayak.[6]

Following the ideas above, adiabatically braiding these anyons around each-other with result in a unitary transformation. These braid operators are a result of two subclasses of operators:

The R matrix can be conceptually thought of as the topological phase that is imparted onto the anyons during the braid. As the anyons wind around each-other, they pick up some phase due to the Aharonov-Bohm effect.

The F matrix is a result of the physical rotations of the anyons. As they braid between each-other, it is important to realize that the bottom two anyonsthe control groupwill still distinguish the state of the qubit. Thus, braiding the anyons will change which anyons are in the control group, and therefore change the basis. We evaluate the anyons by always fusing the control group (the bottom anyons) together first, so exchanging which anyons these are will rotate the system. Because these anyons are non-abelian, the order of the anyons (which ones are within the control group) will matter, and as such they will transform the system.

The complete braid operator can be derived as:

B = F 1 R F {displaystyle B=F^{-1}RF}

In order to mathematically construct the F and R operators, we can consider permutations of these F and R operators. We know that if we sequentially change the basis that we are operating on, this will eventually lead us back to the same basis. Similarly, we know that if we braid anyons around each-other a certain number of times, this will lead back to the same state. These axioms are called the pentagonal and hexagonal axioms respectively as performing the operation can be visualized with a pentagon/hexagon of state transformations. Although mathematically difficult,[7] these can be approached much more successfully visually.

With these braid operators, we can finally formalize the notion of braids in terms of how they act on our Hilbert space and construct arbitrary universal quantum gates.

Explicit braids that perform particular quantum computations with Fibonacci anyons have been given by [8]

See the original post:

Topological quantum computer - Wikipedia

- Google claims to have invented a quantum computer, but IBM begs to differ - The Conversation CA - January 22nd, 2020
- Xanadu Receives $4.4M Investment from SDTC to Advance its Photonic Quantum Computing Technology - Quantaneo, the Quantum Computing Source - January 22nd, 2020
- U of T's Peter Wittek, who will be remembered at Feb. 3 event, on why the future is quantum - News@UofT - January 17th, 2020
- Quantum Computing Technologies Market 2019, Size, Share, Global Industry Growth, Business Statistics, Top Leaders, Competitive Landscape, Forecast To... - January 17th, 2020
- This Week In Security: Windows 10 Apocalypse, Paypal Problems, And Cablehaunt - Hackaday - January 17th, 2020
- Kitchener's Angstrom Engineering is making a quantum leap with its next-generation technology - TheRecord.com - January 17th, 2020
- Xanadu Receives $4.4M Investment from SDTC to Advance its Photonic Quantum Computing Technology - Yahoo Finance - January 16th, 2020
- The dark side of IoT, AI and quantum computing: Hacking, data breaches and existential threat - ZDNet - January 16th, 2020
- 'How can we compete with Google?': the battle to train quantum coders - The Guardian - January 16th, 2020
- IBM heads US patent list for 27th consecutive year - Technology Decisions - January 16th, 2020
- New Technique May Be Capable of Creating Qubits From Silicon Carbide Wafer - Tom's Hardware - January 14th, 2020
- The hunt for the 'angel particle' continues - Big Think - January 13th, 2020
- How to verify that quantum chips are computing correctly - MIT News - January 13th, 2020
- Googles Quantum Supremacy will mark the End of the Bitcoin in 2020 - The Coin Republic - January 13th, 2020
- Bleeding edge information technology developments - IT World Canada - January 13th, 2020
- Jeffrey Epstein scandal: MIT professor put on leave, he 'failed to inform' college that sex offender made donations - CNBC - January 10th, 2020
- The teenager that's at CES to network - Yahoo Singapore News - January 10th, 2020
- AI, ML and quantum computing to cement position in 2020: Alibabas Jeff Zhang - Tech Observer - January 8th, 2020
- Perspective: End Of An Era | WNIJ and WNIU - WNIJ and WNIU - January 8th, 2020
- Volkswagen carried out the world's first pilot project for traffic optimization with a quantum computer - Quantaneo, the Quantum Computing Source - January 6th, 2020
- The 12 Most Important and Stunning Quantum Experiments of 2019 - Livescience.com - December 31st, 2019
- Physicists Just Achieved The First-Ever Quantum Teleportation Between Computer Chips - ScienceAlert - December 31st, 2019
- Quantum Supremacy and the Regulation of Quantum Technologies - The Regulatory Review - December 31st, 2019
- The Best of Science in 2019 - Research Matters - December 31st, 2019
- Technology And Society: Can Marketing Save The World? - Forbes - December 31st, 2019
- From the image of a black hole to 'artificial embryos', 2019 was the year of many firsts in science - Economic Times - December 28th, 2019
- Information teleported between two computer chips for the first time - New Atlas - December 26th, 2019
- Same Plastic That Make Legos Could Also Be The Best Thermal Insulators Used in Quantum Computers - KTLA Los Angeles - December 26th, 2019
- Quanta's Year in Math and Computer Science (2019) - Quanta Magazine - December 26th, 2019
- 2019 EurekAlert! Trending Release List the most international ever - Science Codex - December 26th, 2019
- The big science and environment stories of 2019 - BBC News - December 26th, 2019
- Could quantum computing be the key to cracking congestion? - SmartCitiesWorld - December 15th, 2019
- ProBeat: AWS and Azure are generating uneasy excitement in quantum computing - VentureBeat - December 15th, 2019
- Will quantum computing overwhelm existing security tech in the near future? - Help Net Security - December 15th, 2019
- Quantum expert Robert Sutor explains the basics of Quantum Computing - Packt Hub - December 15th, 2019
- Traditional cryptography doesn't stand a chance against the quantum age - Inverse - December 15th, 2019
- China is beating the US when it comes to quantum security - MIT Technology Review - December 15th, 2019
- Technology to Highlight the Next 10 Years: Quantum Computing - Somag News - December 15th, 2019
- Quantum Trends And The Internet of Things - Forbes - December 6th, 2019
- Quantum supremacy is here, but smart data will have the biggest impact - Quantaneo, the Quantum Computing Source - December 6th, 2019
- Beer With Bella: Tyson Yunkaporta - The New York Times - December 6th, 2019
- The New Cold War? Its With China, and It Has Already Begun - The New York Times - December 2nd, 2019
- How Countries Are Betting on to Become Supreme in Quantum Computing - Analytics Insight - December 2nd, 2019
- Study: Our universe may be part of a giant quantum computer - The Next Web - November 28th, 2019
- First quantum computing conference to take place in Cambridge - Cambridge Independent - November 28th, 2019
- Threat of quantum computing hackathon to award $100,000 - App Developer Magazine - November 28th, 2019
- World High Performance Computing (HPC) Market Oulook Report, 2019-2024 - HPC Will Be Integral to Combined Classical & Quantum Computing Hybrid... - November 28th, 2019
- ETU "LETI" first won the Bertrand Meyer Award - QS WOW News - November 28th, 2019
- Global Quantum Computing Market is Set to Experience Revolutionary Growth With +25% CAGR by 2025 | Top Players D-Wave Systems Inc., QX Branch, Google... - November 28th, 2019
- Japan plots 20-year race to quantum computers, chasing US and China - Nikkei Asian Review - November 23rd, 2019
- A super cover illustration highlights superconductivity research - The Mix - November 23rd, 2019
- The future that graphene built - Knowable Magazine - November 23rd, 2019
- New Berlin foundation turns AI into immersive art - Art Newspaper - November 23rd, 2019
- Maryanna Saenko and Steve Jurvetson of Future Ventures talk SpaceX, the Boring Co. and . . . ayahuasca - TechCrunch - November 23rd, 2019
- Quantum Hackathon With $100,000 Prize Receives Overwhelming Response - Yahoo Finance - November 22nd, 2019
- Quantum Computing: Challenges, Trends and the Road Ahead - CMSWire - November 20th, 2019
- Researchers Have Achieved a New Level of Quantum Supremacy - TechDecisions - November 20th, 2019
- Will quantum computers revolutionize the world? The Courier - The Courier - November 20th, 2019
- Reality is subjective to the observer - scientists make stunning claim in quantum study - Express.co.uk - November 20th, 2019
- Geeking Out With Legendary Futurist and Investor Steve Jurvetson - mySanAntonio.com - November 20th, 2019
- Hedera Hashgraph (HBAR) Founder Says Quantum Computing Is Not a Threat to Cryptocurrency, Although That Claim Is Debatable Crypto.IQ | Bitcoin and... - November 18th, 2019
- Innovation Focused Firms Issue Open Call for Hackers - IndustryWeek - November 18th, 2019
- Quantum computer - Simple English Wikipedia, the free ... - October 11th, 2019
- What is a quantum computer? Explained with a simple example. - September 11th, 2019
- Qubits and Defining the Quantum Computer | HowStuffWorks - September 5th, 2019
- For a Split Second, a Quantum Computer Made History Go ... - May 13th, 2019
- Noisy Quantum Computers Could Be Good for Chemistry Problems ... - April 11th, 2019
- What is a Quantum Computer? - Definition from Techopedia - April 11th, 2019
- What Is a Quantum Computer? | JSTOR Daily - April 11th, 2019
- Measuring Quantum Computer Power With IBM Quantum Volume ... - April 9th, 2019
- Explainer: What is a quantum computer ... - March 24th, 2019
- What Can We Do with a Quantum Computer? | Institute for ... - March 7th, 2019
- Qubit - Wikipedia - February 25th, 2019
- Quantum computer | computer science | Britannica.com - January 10th, 2019
- IBMs new quantum computer is a symbol, not a breakthrough - January 9th, 2019
- IBM unveils the world's first quantum computer that ... - January 9th, 2019
- Were Close to a Universal Quantum Computer, Heres Where We're At - November 28th, 2018
- Schrdinger's Killer App: Race to Build the World's First ... - August 7th, 2018
- How Quantum Computers Work - May 3rd, 2018
- This is what a 50-qubit quantum computer looks like - January 15th, 2018

## Recent Comments