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

ACM SIGACT News

Guest column

John Watrous

Published Jun 10, 2011• 13 citations
Publisher

Abstract

column Share on Guest column: an introduction to quantum information and quantum circuits 1 Author: John Watrous Institute for Quantum Computing and School of Computer Science, University of Waterloo Institute for Quantum Computing and School of Computer Science, University of WaterlooView Profile Authors Info & Claims ACM SIGACT NewsVolume 42Issue 2June 2011 pp 52–67https://doi.org/10.1145/1998037.1998053Online:10 June 2011Publication History 6citation143DownloadsMetricsTotal Citations6Total Downloads143Last 12 Months10Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

DOI
10.1145/1998037.1998053

Related papers

Quantum computing

Gilles Brassard A

article Free Access Share on Quantum computing: the end of classical cryptography? Author: Gilles Brassard View Profile Authors Info & Claims ACM SIGACT NewsVolume 25Issue 4Dec. 1994 pp 15–21https://doi.org/10.1145/190616.190617Published:01 December 1994Publication History 7citation1,254DownloadsMetricsTotal Citations7Total Downloads1,254Last 12 Months190Last 6 weeks19 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

ACM SIGACT News•Dec 1, 1994•18 citations

Guest Column

Ryan O’Donnell, John Wright

column Share on Guest Column: A Primer on the Statistics of Longest Increasing Subsequences and Quantum States (Shortened Version) Authors: Ryan O'Donnell Carnegie Mellon University, Pittsburgh, PA Carnegie Mellon University, Pittsburgh, PAView Profile , John Wright Massachusetts Institute of Technology, Cambridge, MA Massachusetts Institute of Technology, Cambridge, MAView Profile Authors Info & Claims ACM SIGACT NewsVolume 48Issue 3September 2017 pp 37–59https://doi.org/10.1145/3138860.3138869Published:07 September 2017Publication History 2citation85DownloadsMetricsTotal Citations2Total Downloads85Last 12 Months9Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

ACM SIGACT News•Sep 7, 2017•6 citations

Guest Column

Carlo Mereghetti, Beatrice Palano

Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).

ACM SIGACT News•Oct 17, 2021•4 citations

Quantum computer science

Eleanor Gilbert Rieffel

column Share on Quantum computer science: an introduction author of book: N. David Mermin's publisher: cambridge press, 2007, 236 pages Author: Eleanor Rieffel FX Palo Alto Laboratory, Silicon Valley, CA, USA FX Palo Alto Laboratory, Silicon Valley, CA, USAView Profile Authors Info & Claims ACM SIGACT NewsVolume 41Issue 3September 2010pp 39–44https://doi.org/10.1145/1855118.1855127Published:03 September 2010Publication History 0citation336DownloadsMetricsTotal Citations0Total Downloads336Last 12 Months14Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

ACM SIGACT News•Sep 3, 2010•0 citations

Guest Editorial: Special Section on Quantum Information Processing

Hai‐Zhi Song

Journal of Electronic Science and Technology•Sep 1, 2019•0 citations

Review of efficient secure two-party protocols

Jonathan I. Katz

review-article Share on Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell Author: Jonathan Katz University of Maryland University of MarylandView Profile Authors Info & Claims ACM SIGACT NewsVolume 43Issue 1March 2012 pp 21–23https://doi.org/10.1145/2160649.2160656Online:07 March 2012Publication History 1citation124DownloadsMetricsTotal Citations1Total Downloads124Last 12 Months9Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

ACM SIGACT News•Mar 7, 2012•1 citation
column Share on Guest column: an introduction to quantum information and quantum circuits 1 Author: John Watrous Institute for Quantum Computing and School of Computer Science, University of Waterloo Institute for Quantum Computing and School of Computer Science, University of WaterlooView Profile Authors Info & Claims ACM SIGACT NewsVolume 42Issue 2June 2011 pp 52–67https://doi.org/10.1145/1998037.1998053Online:10 June 2011Publication History 6citation143DownloadsMetricsTotal Citations6Total Downloads143Last 12 Months10Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
article Free Access Share on Quantum computing: the end of classical cryptography? Author: Gilles Brassard View Profile Authors Info & Claims ACM SIGACT NewsVolume 25Issue 4Dec. 1994 pp 15–21https://doi.org/10.1145/190616.190617Published:01 December 1994Publication History 7citation1,254DownloadsMetricsTotal Citations7Total Downloads1,254Last 12 Months190Last 6 weeks19 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
column Share on Guest Column: A Primer on the Statistics of Longest Increasing Subsequences and Quantum States (Shortened Version) Authors: Ryan O'Donnell Carnegie Mellon University, Pittsburgh, PA Carnegie Mellon University, Pittsburgh, PAView Profile , John Wright Massachusetts Institute of Technology, Cambridge, MA Massachusetts Institute of Technology, Cambridge, MAView Profile Authors Info & Claims ACM SIGACT NewsVolume 48Issue 3September 2017 pp 37–59https://doi.org/10.1145/3138860.3138869Published:07 September 2017Publication History 2citation85DownloadsMetricsTotal Citations2Total Downloads85Last 12 Months9Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Quantum computing is a prolific research area, halfway between physics and computer science [27, 29, 52]. Most likely, its origins may be dated back to 70's, when some works on quantum information began to appear (see, e.g., [34, 37]). In early 80's, R.P. Feynman suggested that the computational power of quantum mechanical processes might be beyond that of traditional computation models [25]. Almost at the same time, P. Benioff already proved that such processes are at least as powerful as Turing machines [9]. In 1985, D. Deutsch [22] proposed the notion of a quantum Turing machine as a physically realizable model for a quantum computer. From the point of view of structural complexity, E. Bernstein and U. Vazirani introduced in [20] the class BQP of problems solvable in polynomial time on quantum Turing machines, focusing attention on relations with the corresponding deterministic and probabilistic classes P and BPP, respectively. Several works in the literature explored classical issues in complexity theory from the quantum paradigm perspective (see, e.g., [7, 60, 61]).
column Share on Quantum computer science: an introduction author of book: N. David Mermin's publisher: cambridge press, 2007, 236 pages Author: Eleanor Rieffel FX Palo Alto Laboratory, Silicon Valley, CA, USA FX Palo Alto Laboratory, Silicon Valley, CA, USAView Profile Authors Info & Claims ACM SIGACT NewsVolume 41Issue 3September 2010pp 39–44https://doi.org/10.1145/1855118.1855127Published:03 September 2010Publication History 0citation336DownloadsMetricsTotal Citations0Total Downloads336Last 12 Months14Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
review-article Share on Review of efficient secure two-party protocols: techniques and constructions by Carmit Hazay and Yehuda Lindell Author: Jonathan Katz University of Maryland University of MarylandView Profile Authors Info & Claims ACM SIGACT NewsVolume 43Issue 1March 2012 pp 21–23https://doi.org/10.1145/2160649.2160656Online:07 March 2012Publication History 1citation124DownloadsMetricsTotal Citations1Total Downloads124Last 12 Months9Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access