Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Survey of Results

Norman E. Hurt

Published Jan 1, 1983• 1 citation
Publisher
DOI
10.1007/978-94-009-6963-6_1

Related papers

Summary of Results

Laura Ortiz Martín

Springer theses•Jan 1, 2019•0 citations

Point–Counterpoint: Can Anything Be Learned from Surveys on the Interpretations of Quantum Mechanics?

Matthew Leifer, Nathan L. Harshman

"In what follows, Matt Leifer and Nathan Harshman present opposing views on the value of surveys on foundational attitudes towards quantum mechanics. Three such surveys were recently published and their results are summarized in Table 1. Matt takes the `point,’ arguing that such surveys are not useful, while Nathan takes the `counterpoint.’ A complete set of references for both is given at the end."

•Jan 1, 2013•0 citations

Results and Discussion

Afzal Chaudhry, Hans Kleinpoppen

Springer series on atomic, optical, and plasma physics•Sep 2, 2010•0 citations

General Cryptographic Protocols: The Very Basics

Oded Goldreich

We survey basic definitions and results concerning secure multi-party computations, where the two-party case is an important special case. In a nutshell, these results assert that, under a variety of reasonable settings and/or assumptions, it is possible to construct protocols for securely computing any desirable multi-party functionality. Confining ourselves to the very basics of this vast area of study, we focus on the stand-alone setting, while leaving the survey of the study of the security of concurrent executions to other surveys.

IOS Press eBooks•Jan 1, 2013•5 citations

Summary

Beatrice Marie Ellerhoff

Essentials•Jan 1, 2022•0 citations

Quantum NP - A Survey

Dorit Aharonov, Tomer Naveh

We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. The result builds upon the classical Cook-Levin proof of the NP completeness of SAT, but differs from it in several fundamental ways, which we highlight. This result raises a rich array of open problems related to quantum complexity, algorithms and entanglement, which we state at the end of this survey. This survey is the extension of lecture notes taken by Naveh for Aharonov's quantum computation course, held in Tel Aviv University, 2001.

arXiv:quant-ph/0210077•Oct 11, 2002•242 citations
We survey basic definitions and results concerning secure multi-party computations, where the two-party case is an important special case. In a nutshell, these results assert that, under a variety of reasonable settings and/or assumptions, it is possible to construct protocols for securely computing any desirable multi-party functionality. Confining ourselves to the very basics of this vast area of study, we focus on the stand-alone setting, while leaving the survey of the study of the security of concurrent executions to other surveys.
We describe Kitaev's result from 1999, in which he defines the complexity class QMA, the quantum analog of the class NP, and shows that a natural extension of 3-SAT, namely local Hamiltonians, is QMA complete. The result builds upon the classical Cook-Levin proof of the NP completeness of SAT, but differs from it in several fundamental ways, which we highlight. This result raises a rich array of open problems related to quantum complexity, algorithms and entanglement, which we state at the end of this survey. This survey is the extension of lecture notes taken by Naveh for Aharonov's quantum computation course, held in Tel Aviv University, 2001.