Ryan O'Donnell
Skip Abstract Section
Abstract
We present results in structural complexity theory concerned with the following interrelated topics: computation with postselection/restarting, closed timelike curves (CTCs), and approximate counting. The first result is a new characterization of the lesser known complexity class BPPpath in terms of more familiar concepts. Precisely, BPPpath is the class of problems that can be efficiently solved with a nonadaptive oracle for the approximate counting problem. Similarly, PP equals the class of problems that can be solved efficiently with nonadaptive queries for the related approximate difference problem. Another result is concerned with the computational power conferred by CTCs, or equivalently, the computational complexity of finding stationary distributions for quantum channels. Using the preceding characterization of PP, we show that any poly(n)-time quantum computation using a CTC of O(log n) qubits may as well just use a CTC of 1 classical bit. This result essentially amounts to showing that one can find a stationary distribution for a poly(n)-dimensional quantum channel in PP.
- Scott Aaronson. 2004. Is Quantum Mechanics an Island in Theoryspace? Technical Report quant-ph/0401062. arXiv.Google Scholar
- Scott Aaronson. 2004. Limits on Efficient Computation in the Physical World. Ph.D. Dissertation. University of California, Berkeley. Google ScholarDigital Library
- Scott Aaronson. 2005. NP-complete problems and physical reality. ACM SIGACT News 36, 1, 30--52. Google ScholarDigital Library
- Scott Aaronson. 2005. Quantum computing, postselection, and probabilistic polynomial-time. Proceedings of the Royal Society A 461, 2063, 3473--3482.Google ScholarCross Ref
- Scott Aaronson. 2014. PostBQP Postscripts: A Confession of Mathematical Errors. Retrieved March 21, 2018, from http://www.scottaaronson.com/blog/?p=2072.Google Scholar
- Scott Aaronson and Alex Arkhipov. 2011. The computational complexity of linear optics. In Proceedings of the 43rd Annual ACM Symposium on Theory of Computing. 333--342. Google ScholarDigital Library
- Scott Aaronson and John Watrous. 2009. Closed timelike curves make quantum and classical computing equivalent. Proceedings of the Royal Society A 465, 2102, 631--647.Google ScholarCross Ref
- Eric Allender, Vikraman Arvind, and Meena Mahajan. 2003. Arithmetic complexity, Kleene closure, and formal power series. Theory of Computing Systems 36, 4, 303--328.Google ScholarCross Ref
- James Aspnes, David Fischer, Michael Fischer, Ming-Yang Kao, and Alok Kumar. 2001. Towards understanding the predictability of stock markets from the perspective of computational complexity. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. 745--754. Google ScholarDigital Library
- Dave Bacon. 2004. Quantum computational complexity in the presence of closed timelike curves. Physical Review A 70, 3, 032309.Google ScholarCross Ref
- Richard Beigel, Nick Reingold, and Daniel Spielman. 1995. PP is closed under intersection. Journal of Computer and System Sciences 50, 2, 191--202. Google ScholarDigital Library
- Elmar Böhler, Christian Glaßer, and Daniel Meister. 2003. Error-bounded probabilistic computations between MA and AM. In Proceedings of the 28th Annual International Symposium on Mathematical Foundations of Computer Science. 249--258.Google ScholarCross Ref
- Michael Bremner, Richard Jozsa, and Dan Shepherd. 2010. Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proceedings of the Royal Society A. 467, 2126, 459--472.Google Scholar
- David Deutsch. 1991. Quantum mechanics near closed timelike lines. Physical Review D 44, 10, 3197--3217.Google ScholarCross Ref
- Stephen Fenner, Frederic Green, Steven Homer, and Randall Pruim. 1999. Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 455, 1991, 3953--3966.Google ScholarCross Ref
- Lance Fortnow and Nick Reingold. 1996. PP is closed under truth-table reductions. Information and Computation 124, 1, 1--6. Google ScholarDigital Library
- Lance Fortnow and John Rogers. 1999. Complexity limitations on quantum computation. Journal of Computer and System Sciences 59, 2, 240--252. Google ScholarDigital Library
- John Gill. 1974. Computational complexity of probabilistic turing machines. In Proceedings of the 6th Annual ACM Symposium on Theory of Computing. 91--95. Google ScholarDigital Library
- Kurt Gödel. 1949. An example of a new type of cosmological solutions of Einstein’s field equations of gravitation. Reviews of Modern Physics 21, 3, 447--450.Google ScholarCross Ref
- Carla Gomes, Ashish Sabharwal, and Bart Selman. 2006. Model counting: A new strategy for obtaining good bounds. In Proceedings of the National Conference on Artificial Intelligence, Vol. 21. 54. Google ScholarDigital Library
- Yenjo Han, Lane Hemaspaandra, and Thomas Thierauf. 1997. Threshold computation and cryptographic security. SIAM Journal on Computing 26, 1, 59--78. Google ScholarDigital Library
- Yenjo Ham, Lane Hemaspaandra, and Thomas Thierauf. 1993. Threshold computation and cryptographic security. In Proceedings of the 4th Annual International Symposium on Algorithms and Computation. 230--239. Google ScholarDigital Library
- Ryan O’Donnell and A. C. Cem Say. 2014. One time-traveling bit is as good as logarithmically many. In Proceedings of the 35th Annual IARCS Conference on Foundations of Software Technology and Theoretical Computer Science.Google Scholar
- Claudia Peschiera, Luca Pulina, Armando Tacchella, Uwe Bubeck, Oliver Kullmann, and Inês Lynce. 2010. The seventh QBF solvers evaluation (QBFEVAL’10). In Theory and Applications of Satisfiability Testing—SAT 2010. Springer, 237--250. Google ScholarDigital Library
- A. C. Cem Say and Abuzer Yakaryılmaz. 2012. Computation with multiple CTCs of fixed length and width. Natural Computing 11, 4, 579--594. Google ScholarDigital Library
- Ronen Shaltiel and Christopher Umans. 2006. Pseudorandomness for approximate counting and sampling. Computational Complexity 15, 4, 298--341. Google ScholarDigital Library
- Janos Simon. 1975. On Some Central Problems in Computational Complexity. Ph.D. Dissertation. Cornell University. Google ScholarDigital Library
- Carsten Sinz and Uwe Egly (Eds.). 2014. Theory and Applications of Satisfiability Testing—SAT 2014. Lecture Notes in Computer Science, Vol. 8561. Springer.Google Scholar
- Michael Sipser. 1983. A complexity theoretic approach to randomness. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing. 330--335. Google ScholarDigital Library
- Larry Stockmeyer. 1983. The complexity of approximate counting. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing. 118--126. Google ScholarDigital Library
- Larry Stockmeyer. 1985. On approximation algorithms for #P. SIAM Journal on Computing 14, 4, 849--861.Google ScholarCross Ref
- Seinosuke Toda. 1991. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing 20, 5, 865--877. Google ScholarDigital Library
- John Watrous. 2008. Quantum Computational Complexity. Technical Report 0804.3401. arXiv.Google Scholar
- Michael Wolf. 2012. Quantum Channels and Operations: Guided Tour. Retrieved March 21, 2018, from http://www-m5.ma.tum.de/foswiki/pub/M5/Allgemeines/MichaelWolf/QChannelLecture.pdf.Google Scholar
- Abuzer Yakaryılmaz and A. C. Cem Say. 2013. Proving the power of postselection. Fundamenta Informaticae 123, 1, 107--134. Google ScholarDigital Library
Index Terms
- The Weakness of CTC Qubits and the Power of Approximate Counting
Recommendations
Pseudorandomness for Approximate Counting and Sampling
We study computational procedures that use both randomness and nondeterminism. The goal of this paper is to derandomize such procedures under the weakest possible assumptions.
Our main technical contribution allows one to "boost" a given hardness ...
Fine-grained reductions from approximate counting to decision
STOC 2018: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of ComputingIn this paper, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions. (Thus we use an oracle that decides whether any witness exists to multiplicatively approximate the number of ...
Comments