Finding resource states of measurement-based quantum computing is harder than quantum computing

Finding resource states of measurement-based quantum computing is harder than quantum computing

Measurement-based quantum computing enables universal quantum computing with only adaptive single-qubit measurements on certain many-qubit states, such as the graph state, the AffleckKennedy-Lieb-Tasaki (AKLT) state, and several tensor-network states. Finding new resource states of measurement-based quantum computing is a hard task, since for a given state there are exponentially many possible ...

Spin-Based Quantum Dot Quantum Computing

Resource optimization for fault-tolerant quantum computing

Quantum computing offers the potential for efficiently solving otherwise classically difficult problems, with applications in material and drug design, cryptography, theoretical physics, number theory and more. However, quantum systems are notoriously fragile; interaction with the surrounding environment and lack of precise control constitute noise, which makes construction of a reliable quantu...

Entanglement-based Quantum Computing by Diagrams of States

We explore entanglement in composite quantum systems and how its peculiar properties are exploited in quantum information and communication protocols by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by quantum circuits. We present quantum diagrams of states for Bell states generation, measurem...

Topological quantum computing with Read-Rezayi states.

Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which, in principle, can be used for topological quantum computation. We present a prescription for efficiently finding braids which can be used to carry out a universal set of quantum gates on encoded qubits based on anyons of the Read-Rezayi states with k>2, k not equal 4. This work exte...