REVIEW 1 cited by
Quantum computation by measurements
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
read the original abstract
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction [quant-ph/0108020]. Then, we prove the universality of simple discrete sets of 2-qubit measurements, again using a scheme simplifying the initial construction [quant-ph/0111122]. Finally, we show how to use a single 4-qubit measurement to achieve universal quantum computation, and outline a proof for the universality of almost all maximally entangling 4-qubit measurements.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.