Researcher interests: Quantum computation. Quantum cryptography. The quantum-classic boundary. Error correction. Markov chains. Computational complexity.
DEPARTMENT: Computer Science
Contact Business Development: Tamir Huberman

Selected Publications

Dorit Aharonov, ayal green, chingyi lai, kaimin chung, sattath, zvika brakerski
on quantum advantage in information theoretic single server pir (2019)| arXiv preprint arXiv:1902.09768| Read more
Dorit Aharonov, leo zhou
hamiltonian sparsification and gap simulation (2019)| arXiv: Quantum Physics| Read more
Dorit Aharonov, yonathan touati
quantum circuit depth lower bounds for homological codes (2018)| arXiv preprint arXiv:1810.03912| Read more
Dorit Aharonov, leo zhou
on gap simulation of hamiltonians and the impossibility of quantum degree reduction (2018)| | Read more
Dorit Aharonov, itamar vigdorovich, oded kenneth
on the complexity of two dimensional commuting local hamiltonians (2018)| arXiv preprint arXiv:1803.02213| Read more
Dorit Aharonov, yosi atia
fast forwarding of hamiltonians and exponentially precise measurements (2017)| Nature Communications| Read more
Dorit Aharonov, ayal green
a quantum inspired proof of p p subseteq ip (2017)| arXiv preprint arXiv:1710.09078| Read more
Dorit Aharonov, loick magnin, maor ganz
dining philosophers leader election and ring size problems in the quantum setting (2017)| arXiv preprint arXiv:1707.01187| Read more
Dorit Aharonov, andre chailloux, iordanis kerenidis, loick magnin, maor ganz
a simpler proof of existence of quantum weak coin flipping with arbitrarily small bias (2016)| SIAM Journal on Computing| Read more
Dorit Aharonov, david herreramarti, Nadav Katz, Alexander Retzker, tuvia gefen
quantum error correction enhanced magnetometer overcoming the limit imposed by relaxation (2015)| Physical Review Letters| Read more
Dorit Aharonov, Michael Ben-Or, Elad Eban, michael benor
interactive proofs for quantum computations (2010)| international conference on supercomputing| Read more
Dorit Aharonov, Michael Ben-Or, fernando brandao, michael benor, sattath
the pursuit for uniqueness extending valiant vazirani theorem to the probabilistic and quantum settings (2008)| arXiv preprint arXiv:0810.4840| Read more
fault tolerant quantum computation with constant error rate (2008)| SIAM Journal on Computing| Read more
the commuting local hamiltonian problem on locally expanding graphs is approximable in mathsf np np ()| Quantum Information Processing| Read more

Contact for more information:

Tamir Huberman
CIO
+972-2-6586678
Contact ME: