REVIEW 6 cited by
An introduction to measurement based quantum computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
In the formalism of measurement based quantum computation we start with a given fixed entangled state of many qubits and perform computation by applying a sequence of measurements to designated qubits in designated bases. The choice of basis for later measurements may depend on earlier measurement outcomes and the final result of the computation is determined from the classical data of all the measurement outcomes. This is in contrast to the more familiar gate array model in which computational steps are unitary operations, developing a large entangled state prior to some final measurements for the output. Two principal schemes of measurement based computation are teleportation quantum computation (TQC) and the so-called cluster model or one-way quantum computer (1WQC). We will describe these schemes and show how they are able to perform universal quantum computation. We will outline various possible relationships between the models which serve to clarify their workings. We will also discuss possible novel computational benefits of the measurement based models compared to the gate array model, especially issues of parallelisability of algorithms.
Forward citations
Cited by 6 Pith papers
-
Fast mixing of all-to-all quantum systems at high temperatures
k-local quantum Hamiltonians admit system-size-independent spectral gap for Gibbs samplers at high temperature, enabling FPT quantum approximation algorithms for partition functions.
-
Localized Entanglement Purification
Localized Entanglement Purification (LEP) is a new family of protocols that purifies entanglement at the level of network regions by exploiting spatial noise asymmetries to reduce resource consumption for larger quant...
-
Programmable Quantum Matter: Heralding Large Cluster States in Driven Inhomogeneous Spin Ensembles
A single SAFE-GRAPE-optimized global strain pulse is shown by simulation to give O(1) control of inhomogeneous SiV ensembles, with more robust dynamical decoupling and O(10^2 to 10^4) more usable heralded entanglement...
-
Improved Strategies for Fermionic Quantum Simulation with Global Interactions
Quantum circuits for single and double fermionic excitations on ion traps reduce MS gate counts by factors of 2 and 4 respectively by using global interactions for optimal parallelism.
-
A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks
A greedy star-merging protocol distributes GHZ states over arbitrary Bell-pair networks with O(N) gates, N-1 Bell pairs in the complete case, and a polynomial-time alternative to Steiner-tree-based methods.
-
Multicopy quantum state teleportation with application to storage and retrieval of quantum programs
Maximal success probability for multicopy teleportation without receiver correction is p(d,k)=k/[d(k-1+d)], attained by explicit protocol using group representation theory, with application to enhanced quantum program...
Discussion (0). Continue with ORCID to comment.