Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-7479d7b7d-c9gpj Total loading time: 0 Render date: 2024-07-10T17:29:18.805Z Has data issue: false hasContentIssue false

18 - Fun with the Anthropic Principle1

Published online by Cambridge University Press:  05 April 2013

Scott Aaronson
Scott Aaronson
Affiliation:
Massachusetts Institute of Technology
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Quantum Computing since Democritus , pp. 266 - 289
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Gott III, J. R., Implications of the Copernican principle for our future prospects. Nature, 363:6427 (1993), 315–319.CrossRefGoogle Scholar
BPP was defined in Y. Han, L. A. Hemaspaandra, and T. Thierauf, Threshold computation and cryptographic security. SIAM Journal on Computing, 26:1 (1997), 59–78.
Adleman, L. M., DeMarrais, J., and Huang, M.-D. A., Quantum computability. SIAM Journal on Computing, 26:5 (1997), 1524–40.CrossRefGoogle Scholar
Aaronson, S., Quantum computing, postselection, and probabilistic polynomial-time. Proceedings of the Royal Society A, 461:2063 (2005), 3473–82.CrossRefGoogle Scholar
Beigel, R., Reingold, N., and Spielman, D. A., PP is closed under intersection. Journal of Computer and System Sciences, 50:2 (1995), 191–202.CrossRefGoogle Scholar
Bremner, M., Jozsa, R., and Shepherd, D., Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. Proceedings of the Royal Society A, 467:2126 (2010), 459–72.CrossRefGoogle Scholar
Aaronson, S. and Arkhipov, A., The computational complexity of linear optics. In Proceedings of Annual ACM Symposium on Theory of Computing (2011), pp. 333–42.

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×