Finding Optimal Flows Efficiently

DOI10.1007/978-3-540-70575-8_70zbMath1153.68379arXiv0709.2670OpenAlexW2130674235MaRDI QIDQ3521971

Mehdi Mhalla, Simon Perdrix

Publication date: 28 August 2008

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.2670

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (11)

Outcome determinism in measurement-based quantum computation with qudits ⋮ Symmetry constraints on temporal order in measurement-based quantum computation ⋮ Unnamed Item ⋮ Automatic translation of quantum circuits to optimized one-way quantum computation patterns ⋮ On weak odd domination and graph-based quantum secret sharing ⋮ Optimization of one-way quantum computation measurement patterns ⋮ UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS ⋮ Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation ⋮ Adiabatic graph-state quantum computation ⋮ Reversibility in Extended Measurement-Based Quantum Computation ⋮ Quadratic Form Expansions for Unitaries

This page was built for publication: Finding Optimal Flows Efficiently