Determinism in the one-way model

By Vincent Danos, Elham Kashefi. 2005

142 citations recorded by the source corpus.

We introduce a flow condition on open graph states (graph states with inputs and outputs) which guarantees globally deterministic behavior of a class of measurement patterns defined over them. Dependent Pauli corrections are derived for all such patterns, which equalize all computation branches, and only depend on the underlying entanglement graph and its choice of inputs and outputs. The class of patterns having flow is stable under composition and tensorization, and has unitary embeddings as realizations. The restricted class of patterns having both flow and reverse flow supports an operation of adjunction, and has all and only unitaries as realizations.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/511bf0ac5137a1a6aa77e87ac152384e46bf6c92

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Joseph Francis Fitzsimons
2. Anne Broadbent
3. Elham Kashefi
4. Ashley Montanaro
5. Aram Wettroth Harrow

In Atomic and Molecular Physics, and Optics

1. Joseph Francis Fitzsimons
2. Anne Broadbent
3. Elham Kashefi
4. Aram Wettroth Harrow
5. Ashley Montanaro

Citations in the corpus

• Universal Blind Quantum Computation (2008, methodology): “Here, we assume that the dependency sets Xx,y and Zx,y are obtained via the flow construction [14].”
• Private quantum computation: an introduction to blind quantum computing and related protocols (2016, background): “Thus the measurement bases will in general depend on the outcomes of previous measurements as well as the intended logic gate they correspond to, a dependency formalised for general graphs by the notion of flow.(37) The only remaining element unaccounted for, then, are vertical edges in the graph.”