Farhi, Edward
Overview
Works:  3 works in 3 publications in 1 language and 3 library holdings 

Roles:  Author 
Classifications:  QC1, 
Publication Timeline
.
Most widely held works by
Edward Farhi
Is it possible to create a universe in the laboratory by quantum tunneling? by
E Farhi(
Book
)
1 edition published in 1989 in English and held by 1 WorldCat member library worldwide
1 edition published in 1989 in English and held by 1 WorldCat member library worldwide
Strange matter by E Farhi(
Book
)
1 edition published in 1984 in English and held by 1 WorldCat member library worldwide
1 edition published in 1984 in English and held by 1 WorldCat member library worldwide
Algorithms Speedup From Quantum Mechanics(
)
1 edition published in 2005 in English and held by 0 WorldCat member libraries worldwide
This project was concerned primarily with one central theme which is the attempt to use quantum mechanics to design algorithms that perform better than conventional (nonquantum) algorithms for solving certain problems. We looked at a variety of approaches. The first is quantum adiabatic evolution which was invented by the authors along with M. Sipser and S. Gutmann. During the period of this report we studied the robustness of this algorithm, generalized the algorithm beyond its original specification and also showed that it can outperform classical algorithms in certain settings. We also investigated continuous time quantum walks which were introduced as a quantum algorithmic tool by Farhi and Gutmann. Here the high point was the discovery of a quantum walk algorithm that gives provable exponential speedup over the best possible classical algorithm for a certain oracle problem. Goldstone and Childs (a graduate student at MIT at the time) explored the use of quantum walk algorithms for searching a spatial grid. Also Farhi, Goldstone and coworkers showed how to use repeated measurements as an algorithmic tool. In particular we showed how to achieve the Grover square root speedup using measurement algorithms. In the remainder of the report we will elaborate on these findings and make reference to the associated papers
1 edition published in 2005 in English and held by 0 WorldCat member libraries worldwide
This project was concerned primarily with one central theme which is the attempt to use quantum mechanics to design algorithms that perform better than conventional (nonquantum) algorithms for solving certain problems. We looked at a variety of approaches. The first is quantum adiabatic evolution which was invented by the authors along with M. Sipser and S. Gutmann. During the period of this report we studied the robustness of this algorithm, generalized the algorithm beyond its original specification and also showed that it can outperform classical algorithms in certain settings. We also investigated continuous time quantum walks which were introduced as a quantum algorithmic tool by Farhi and Gutmann. Here the high point was the discovery of a quantum walk algorithm that gives provable exponential speedup over the best possible classical algorithm for a certain oracle problem. Goldstone and Childs (a graduate student at MIT at the time) explored the use of quantum walk algorithms for searching a spatial grid. Also Farhi, Goldstone and coworkers showed how to use repeated measurements as an algorithmic tool. In particular we showed how to achieve the Grover square root speedup using measurement algorithms. In the remainder of the report we will elaborate on these findings and make reference to the associated papers
Audience Level
0 

1  
Kids  General  Special 
Related Identities