Anne Broadbent

Q: What Schools Are Affiliated With Anne Broadbent

Anne Broadbent is affiliated with the following schools: University of Waterloo, Université de Montréal, University of Ottawa

Anne Broadbent's AcademicInfluence.com Rankings

Anne Broadbent

Mathematics

#3577

World Rank

#5258

Historical Rank

Measure Theory

#3849

World Rank

#4537

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Anne Broadbent Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Anne Lise Broadbent is a mathematician at the University of Ottawa who won the 2016 Aisenstadt Prize for her research in quantum computing, quantum cryptography, and quantum information. Early life and education Broadbent specialised in music at De La Salle High School in Ottawa, graduating in 1997. Her interest in science led her to major in mathematics for her undergraduate degree.

(See a Problem?)

Anne Broadbent's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Universal Blind Quantum Computation (2008) (543)
Demonstration of Blind Quantum Computing (2011) (355)
Quantum Pseudo-Telepathy (2004) (175)
Quantum cryptography beyond quantum key distribution (2015) (165)
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity (2014) (157)
Quantum computing on encrypted data (2013) (108)
Parallelizing quantum circuits (2007) (102)
How to Verify a Quantum Computation (2015) (67)
Quantum one-time programs (2013) (63)
Information-Theoretic Security Without an Honest Majority (2007) (62)
Anonymous Quantum Communication (2007) (49)
Computational Security of Quantum Encryption (2016) (46)
Zero-Knowledge Proof Systems for QMA (2016) (45)
Delegating private quantum computations12 (2015) (39)
Recasting mermin's multi-player game into the framework of pseudo-telepathy (2004) (38)
Multi-party Pseudo-Telepathy (2003) (37)
On the power of non-local boxes (2005) (35)
Quantum One-Time Programs - (Extended Abstract) (2012) (34)
Finite-key security analysis for multilevel quantum key distribution (2015) (33)
Quantum Private Information Retrieval has Linear Communication Complexity (2013) (31)
Uncloneable Quantum Encryption via Oracles (2019) (30)
Quantum encryption with certified deletion (2019) (29)
Efficient Simulation for Quantum Message Authentication (2016) (27)
Zero-Knowledge for QMA from Locally Simulatable Proofs (2019) (24)
Can quantum mechanics help distributed computing? (2008) (23)
Measurement-Based and Universal Blind Quantum Computation (2010) (22)
QMA-hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge (2019) (21)
Formal Methods for Quantitative Aspects of Programming Languages (2010) (18)
The GHZ State in Secret Sharing and Entanglement Simulation (2008) (15)
Information-Theoretically Secure Voting Without an Honest Majority (2008) (13)
CAN QUANTUM MECHANICS HELP DISTRIBUTED COMPUTING (2010) (13)
Experimental demonstration of blind quantum computing (2012) (12)
Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation (2015) (12)
Secure Software Leasing Without Assumptions (2021) (11)
Uncloneable Quantum Encryption via Random Oracles (2019) (10)
Anonymous Quantum Communication - (Extended Abstract) (2009) (9)
QMIP = MIP* (2010) (7)
Device-Independent Oblivious Transfer from the Bounded-Quantum-Storage-Model and Computational Assumptions (2021) (6)
Quantum pseudo-telepathy games (2004) (6)
Entanglement swapping, light cones and elements of reality (2005) (5)
Categorical composable cryptography (2021) (4)
Towards Quantum One-Time Memories from Stateless Hardware (2018) (4)
Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters (2010) (3)
Quantum One-Time Memories from Stateless Hardware (2015) (3)
Indistinguishability obfuscation for quantum circuits of low T-count (2020) (3)
Quantum Private Information Retrieval has Linear Communication Complexity (2014) (2)
Rigidity for Monogamy-Of-Entanglement Games (2021) (2)
Classical, Quantum and Non-signalling Resources in Bipartite Games (2008) (2)
The Quantum Locker Puzzle (2008) (2)
Non-signalling correlations imply efficient instantaneous nonlocal quantum computation (2015) (2)
On the logical structure of Bell theorems (2005) (2)
Categorical composable cryptography: extended version (2022) (0)
Quantum delegation with an off-the-shelf device (2023) (0)
Constructions for Quantum Indistinguishability Obfuscation (2020) (0)
Matrix Theory in Quantum Information Théorie des matrices en information quantique (0)
Abstract Submitted for the MAR07 Meeting of The American Physical Society (2006) (0)
Specious Adversaries and Quantum Private Information Retrieval (2013) (0)
UvA-DARE (Digital Academic Repository) Computational security of quantum encryption (2016) (0)
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority (2012) (0)
Password authentication schemes on a quantum computer (2021) (0)
Quantum private broadcasting (2021) (0)
Front Matter, Table of Contents, Preface, List of Contributed Talks, Conference Organization (2016) (0)
Advances in Quantum Communication (2017) (0)
High-Dimensional Quantum Certified Deletion (2023) (0)
Quantum nonlocality, cryptography and complexity (2008) (0)
UvA-DARE (Digital Academic Repository) Quantum cryptography beyond quantum key distribution (2015) (0)
in bipartite games (2007) (0)
O ct 2 00 8 Can quantum mechanics help distributed computing ? (0)
Ju l 2 00 6 On the logical structure of Bell theorems (2006) (0)
Extending the Known Region of Nonlocal Boxes that Collapse Communication Complexity (2023) (0)
Uncloneable Cryptographic Primitives with Interaction (2023) (0)

This paper list is powered by the following services:

Other Resources About Anne Broadbent

en.wikipedia.org

What Schools Are Affiliated With Anne Broadbent?

Anne Broadbent is affiliated with the following schools: