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.
Two-qubit Projective Measurements are Universal for Quantum Computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
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_k$-hierarchy in the indirect construction of unitary gates [Gottesman and Chuang, Nature, {\bf 402} 309 (1999)], and apply the method to find discrete universal sets of 2-qubit measurements.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.