6533b838fe1ef96bd12a3ca6
RESEARCH PRODUCT
Recent Developments in Quantum Algorithms and Complexity
Andris Ambainissubject
Quantum queryComputer scienceSmall number0102 computer and information sciences02 engineering and technologySpan (engineering)01 natural sciences010201 computation theory & mathematicsComputerSystemsOrganization_MISCELLANEOUS020204 information systems0202 electrical engineering electronic engineering information engineeringQuantum algorithmBoolean functionAlgorithmComputer Science::Databasesdescription
We survey several recent developments in quantum algorithms and complexity: Reichardt’s characterization of quantum query algorithms via span programs [15]; New bounds on the number of queries that are necessary for simulating a quantum algorithm that makes a very small number of queries [2]; Exact quantum algorithms with superlinear advantage over the best classical algorithm [4].
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2014-08-05 | Descriptional Complexity of Formal Systems (16th International Workshop, DCFS 2014) |