A query-efficient quantum algorithm for maximum matching on general graphs
type: Item
instance of: scholarly article
title: A query-efficient quantum algorithm for maximum matching on general graphs
DOI: 10.1007/978-3-030-83508-8_39
author: Shelby Kimmel
author: R. Teal Witter
publication date: 2022-03-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2010.02324
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498702
zbMATH Keywords: maximum matching
zbMATH Keywords: quantum algorithm
MaRDI profile type: Publication
OpenAlex ID: W3198528674
cites work: Quantum lower bounds by quantum arguments
cites work: Quantum Algorithms for Matching and Network Flows
cites work: SOFSEM 2004: Theory and Practice of Computer Science
cites work: Quantum algorithms for matching problems
cites work: Paths, Trees, and Flowers
cites work: Optimal Sequencing of Two Equivalent Processors
cites work: The Weighted Matching Approach to Maximum Cardinality Matching
cites work: Q5666587
cites work: Q3549652
cites work: Quantum Query Complexity of State Conversion
cites work: Q3179349
cites work: Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
cites work: Pairwise kidney exchange
cites work: On the power of Ambainis lower bounds
description: scientific article; zbMATH DE number 7498702