1.3k citations
- Perimeter InstituteCA85 papers
- Durham UniversityGB21 papers
- Stanford UniversityUS17 papers
- Harvard UniversityUS15 papers
- Massachusetts Institute of TechnologyUS15 papers
- University of British ColumbiaCA15 papers
- California Institute of TechnologyUS14 papers
- Centre National de la Recherche ScientifiqueFR14 papers
- McMaster UniversityCA14 papers
- University of TorontoCA13 papers
- Canadian Institute for Advanced ResearchCA11 papers
- Space Telescope Science InstituteUS11 papers
Showing 2005 · quant-phShow all
3 papers · 2 filters
quant-ph2005★ 18 cited
Quantum Algorithms for Matching and Network Flows
Andris Ambainis, Robert Spalek
We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time…
quant-ph2005★ 56 cited
Simple proof of fault tolerance in the graph-state model
Panos Aliferis, Debbie W. Leung
We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence…
quant-ph2005★ 1 cited
Classical and quantum fingerprinting with shared randomness and one-sided error
Rolf T. Horn, A. J. Scott, Jonathan Walgate +3
Within the simultaneous message passing model of communication complexity, under a public-coin assumption, we derive the minimum achievable worst-case error probability of a classi…