Quadratic Form Expansions for Unitaries

Authors:
Niel Beaudrap;Vincent Danos;Elham Kashefi;Martin Roetteler
Affiliations:
IQC, University of Waterloo,;School of Informatics, University of Edinburgh,;Laboratoire d'Informatique de Grenoble,;NEC Laboratories America, Inc.,
Venue:
Theory of Quantum Computation, Communication, and Cryptography
Year:
2008

Citing 10
Cited 1

Classical and Quantum Computation

Classical and Quantum Computation
The measurement calculus

Journal of the ACM (JACM)
Finding Optimal Flows Efficiently

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Parallelizing quantum circuits

Theoretical Computer Science
Computational model underlying the one-way quantum computer

Quantum Information & Computation
Quantum computing and polynomial equations over the finite field Z2

Quantum Information & Computation
Optimal synthesis of linear reversible circuits

Quantum Information & Computation
An extremal result for geometries in the one-way measurement model

Quantum Information & Computation
Implementation of Shor's algorithm on a linear nearest neighbour qubit array

Quantum Information & Computation
Cluster states, algorithms and graphs

Quantum Information & Computation

Programmable Hamiltonian for One-way Patterns

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce techniques to analyze unitary operations in terms of quadratic form expansions , a form similar to a sum over paths in the computational basis where the phase contributed by each path is described by a quadratic form over ***. We show how to relate such a form to an entangled resource akin to that of the one-way measurement model of quantum computing. Using this, we describe various conditions under which it is possible to efficiently implement a unitary operation U , either when provided a quadratic form expansion for U as input, or by finding a quadratic form expansion for U from other input data.