activity
19962021
most citedInteractive Proofs For Quantum Computations

92 citations · 423 across the 18 of their papers we have counts for

collaborators

19 papers

quant-ph2021★ 21 cited

High-dimensional coherent one-way quantum key distribution

Kfir Sulimany, Guy Pelc, Rom Dudkiewicz +4

High-dimensional quantum key distribution (QKD) offers secure communication, with secure key rates that surpass those achievable by QKD protocols utilizing two-dimensional encoding…

quant-ph2017

Interactive Proofs for Quantum Computations

Dorit Aharonov, Michael Ben-Or, Elad Eban +1

The widely held belief that BQP strictly contains BPP raises fundamental questions: if we cannot efficiently compute predictions for the behavior of quantum systems, how can we tes…

cs.DS2015★ 2 cited

A Quasi-Random Approach to Matrix Spectral Analysis

Michael Ben-Or, Lior Eldar

Inspired by the quantum computing algorithms for Linear Algebra problems [HHL,TaShma] we study how the simulation on a classical computer of this type of "Phase Estimation algorith…

quant-ph2013★ 1 cited

Optimal algorithms for linear algebra by quantum inspiration

Michael Ben-Or, Lior Eldar

Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical a…

quant-ph2013★ 7 cited

Quantum Refrigerator

Michael Ben-Or, Daniel Gottesman, Avinatan Hassidim

We consider fault-tolerant quantum computation in the context where there are no fresh ancilla qubits available during the computation, and where the noise is due to a general quan…

cs.DC2010★ 1 cited

A Fault-Resistant Asynchronous Clock Function

Ezra N. Hoch, Michael Ben-Or, Danny Dolev

Consider an asynchronous network in a shared-memory environment consisting of n nodes. Assume that up to f of the nodes might be Byzantine (n > 12f), where the adversary is full-in…