One Complexity Theorist's View of Quantum Computing
Lance Fortnow
Abstract
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools of computational complexity theory should come to bear on these important questions. Quantum computing often scares away many potential researchers from computer science because of the apparent background need in quantum mechanics and the alien looking notation used in papers on the topic. This paper will give an overview of quantum computation from the point of view of a complexity theorist. We will see that one can think of BQP as yet another complexity class and study its power without focusing on the physical aspects behind it.
Create a lesson
Related papers
Logical CCZ state cultivation
Yuta Hirasaki, Jong Yeon Lee
Quantum-Aware Key Rank for Side-Channel Attacks evaluation
Yevgen Kotukh
Intermediate memory costs of quantum channel synthesis with a protected subsystem
Kai Liu, Deguang Han
Quantum Work Statistics from Entanglement-Assisted Invariance
Akira Sone, Akram Touil, Emery Doucet et al.
Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction
Hanzhang Zhao, Shenglong Xu
Demonstration of a mobile ion-trap quantum device
Sara Alfaro, Dipesh Bhanushali, Sankarshan Choudapurkar et al.