Demonstrating non-Abelian braiding of surface code defects in a five qubit experiment

@article{Wootton2017DemonstratingNB,
  title={Demonstrating non-Abelian braiding of surface code defects in a five qubit experiment},
  author={James R. Wootton},
  journal={Quantum Science and Technology},
  year={2017},
  volume={2}
}
  • James R. Wootton
  • Published 25 September 2016
  • Physics
  • Quantum Science and Technology
Currently, the mainstream approach to quantum computing is through surface codes. One way to store and manipulate quantum information with these to create defects in the codes which can be moved and used as if they were particles. Specifically, they simulate the behaviour of exotic particles known as Majoranas, which are a kind of non-Abelian anyon. By exchanging these particles, important gates for quantum computation can be implemented. Here we investigate the simplest possible exchange… 

Demonstration of topologically path-independent anyonic braiding in a nine-qubit planar code

Anyons are quasiparticles that obey fractional statistics, producing a phase intermediate to bosons and fermions under particle interchange. Anyons form the basis for topological quantum computation

Repetition code of 15 qubits

The repetition code is an important primitive for the techniques of quantum error correction. Here we implement repetition codes of at most 15 qubits on the 16 qubit ibmqx3 device. Each experiment is

Implementation of quantum compression on IBM quantum computers

This paper reports on implementations of quantum compression algorithm that can efficiently compress unknown quantum information and restricted ourselves to compression of three pure qubits into two qubits, as the complexity of even such a simple implementation is barely within the reach of today's quantum processors.

Quantum Algorithm Implementations for Beginners

This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations and shows how these algorithms can be implemented on IBM’s quantum computer.

A simulational model for witnessing quantum effects of gravity using IBM quantum computer

A simulational model is proposed by providing a new quantum circuit for verifying the schemes to test the quantumness of gravity in two small test masses by entangling two spatially separated objects using gravitational interactions and providing a method to witness the entanglement using spin correlation measurements.

Demonstration of the no-hiding theorem on the 5-Qubit IBM quantum computer in a category-theoretic framework

The quantum no-hiding theorem is demonstrated using the IBM 5Q quantum processor and the recovery of missing information is confirmed by the application of local unitary operations on the ancillary qubits.

Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer

We simulate the dynamics of braiding Majorana zero modes on an IBM Quantum computer. We find the native quantum gates introduce too much noise to observe braiding. Instead, we use Qiskit Pulse to

Five Experimental Tests on the 5-Qubit IBM Quantum Computer

The 5-qubit quantum computer prototypes that IBM has given open access to on the cloud allow the implementation of real experiments on a quantum processor. We present the results obtained in five

Demonstration of Optimal Fixed Point Quantum Search Algorithm : An IBM Quantum Experience

Here, the implementation of optimal fixedpoint quantum search algorithm is demonstrated, more precisely the optimal Grover’s search algorithm, in IBMQ simulator developed by IBM corporation.

References

SHOWING 1-10 OF 33 REFERENCES

Topological quantum memory

We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and

A family of stabilizer codes for D ( Z 2 ) ?> anyons and Majorana modes

The class of qubit topological stabilizer codes that arise in the Abelian phase of the honeycomb lattice model are studied and it is shown that these codes are particularly well suited to engineering twist defects that behave as Majorana modes.

Quantum computations on a topologically encoded qubit

A quantum error-correcting code in which one qubit is encoded in entangled states distributed over seven trapped-ion qubits, which represents a fully functional instance of a topologically encoded qubit, or color code, and opens a route toward fault-tolerant quantum computing.

Demonstration of a quantum error detection code using a square lattice of four superconducting qubits

This work presents a quantum error detection protocol on a two-by-two planar lattice of superconducting qubits that detects an arbitrary quantum error on an encoded two-qubit entangled state via quantum non-demolition parity measurements on another pair of error syndrome qubits.

Error Correction for Non-Abelian Topological Quantum Computation

The properties of non-Abelian error correction, in general are considered, and it is found that error correction is possible under a threshold value of 7% for the total probability of an error on each physical spin, remarkably comparable with the thresholds for Abelian models.

State preservation by repetitive error detection in a superconducting quantum circuit

The protection of classical states from environmental bit-flip errors is reported and the suppression of these errors with increasing system size is demonstrated, motivating further research into the many challenges associated with building a large-scale superconducting quantum computer.

Fermionic Bell-State Analyzer for Spin Qubits

This protocol and physical implementation for partial Bell-state measurements of Fermionic qubits, allowing for deterministic quantum computing in solid-state systems without the need for two-qubit gates, greatly simplifies the experimental realization of scalable quantum computers in electronic nanostructures.

A two-qubit logic gate in silicon

A two-qubit logic gate is presented, which uses single spins in isotopically enriched silicon and is realized by performing single- and two- qubits operations in a quantum dot system using the exchange interaction, as envisaged in the Loss–DiVincenzo proposal.

Quantum computation and quantum information

  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal

Thermalization, Error-Correction, and Memory Lifetime for Ising Anyon Systems

We consider two-dimensional lattice models that support Ising anyonic excitations and are coupled to a thermal bath. We propose a phenomenological model for the resulting short-time dynamics that