Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved method that requires only 2-qubit measurements, which are both sufficient and necessary. We present a method to partially collapse the Cₖ-hierarchy in the indirect construction of unitary gates [Gottesman and Chuang, Nature, { 402} 309 (1999)], and apply the method to find discrete universal sets of 2-qubit measurements.
No takes yet. Share an insight, caveat, or question.
Debbie Leung (2001) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: