{"id":295748,"date":"2016-09-22T12:47:02","date_gmt":"2016-09-22T19:47:02","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&p=295748"},"modified":"2025-08-06T11:59:13","modified_gmt":"2025-08-06T18:59:13","slug":"workshop-on-quantum-algorithms-and-devices","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/workshop-on-quantum-algorithms-and-devices\/","title":{"rendered":"Workshop on Quantum Algorithms and Devices"},"content":{"rendered":"\n\n

Venue:<\/strong>\u00a0Sonora Room, Microsoft Conference Center\u00a0(Building 33)<\/p>\n

The Quantum Algorithms and Devices Workshop was part of the Microsoft Research Faculty Summit 2016<\/a>.Opens in a new tab<\/span><\/p>\n

In 1981, Richard Feynman proposed a device called a \u201cquantum computer\u201d that would take advantage of\u00a0methods founded on the laws of quantum physics and promise computational speed-ups over classical\u00a0methods. In the last three decades, quantum algorithms have been developed that offer fast solutions to\u00a0problems in a variety of fields including number theory, optimization, database search, chemistry, and\u00a0physics. For quantum devices, this past year marks significant progress towards scalable quantum bits and\u00a0gates. The workshop highlighted recent advances in quantum algorithms, quantum devices, control\u00a0systems, and quantum error correction. For a comprehensive list of the topics covered, see the “Abstracts” tab.Opens in a new tab<\/span><\/p>\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
Time<\/th>\nSession<\/th>\nSpeaker<\/th>\n<\/tr>\n<\/thead>\n
\n
8:30 \u2013 9:00<\/div>\n<\/td>\n
\n
Quantum Monte Carlo vs Tunneling in Adiabatic Optimization<\/div>\n<\/td>\n
Aram Harrow<\/td>\n<\/tr>\n
\n
9:05 \u2013 9:35<\/div>\n<\/td>\n
\n
Adiabatic Optimization vs Diffusion Monte Carlo<\/div>\n<\/td>\n
Stephen Jordan<\/td>\n<\/tr>\n
9:40\u00a0\u2013 10:10<\/td>\n\n
Quantum Speed-ups for Semidefinite Programming<\/div>\n<\/td>\n
Fernando Brandao<\/td>\n<\/tr>\n
10:15 \u2013 10:30<\/td>\n\n
Coffee Break<\/div>\n<\/td>\n
<\/td>\n<\/tr>\n
\n
10:35 \u2013 11:05<\/div>\n<\/td>\n
\n
How to Program a Trapped Ions Quantum Computer<\/div>\n<\/td>\n
Dmitri Maslov<\/td>\n<\/tr>\n
\n
11:10\u00a0\u2013 11:40<\/div>\n<\/td>\n
\n
Photonic Quantum Computing<\/div>\n<\/td>\n
Jeremy O\u2019Brien & Terry Rudolph<\/td>\n<\/tr>\n
11:45 \u2013 12:00<\/td>\n\n
LIQUI|> Coding Challenge Winners<\/div>\n<\/td>\n
<\/td>\n<\/tr>\n
12:00 \u2013 1:00<\/td>\n\n
Lunch<\/div>\n<\/td>\n
<\/td>\n<\/tr>\n
1:05 \u2013 1:35<\/td>\n\n
Local Decoders and Their Performance for 2D and\u00a04D Toric Codes<\/div>\n<\/td>\n
Barbara Terhal<\/td>\n<\/tr>\n
1:40 \u2013 2:10<\/td>\n\n
Fault-Tolerant Quantum Memory for Non-Abelian Anyons<\/div>\n<\/td>\n
David Poulin<\/td>\n<\/tr>\n
2:15 \u2013 2:45<\/td>\nQuantum Supremacy<\/td>\nScott Aaronson<\/td>\n<\/tr>\n
2:50\u00a0\u2013 3:05<\/td>\n\n
Coffee Break<\/div>\n<\/td>\n
<\/td>\n<\/tr>\n
3:10 \u2013 3:40<\/td>\n\n
Topology of Local Hamiltonians and Robust Quantum Entanglement<\/div>\n<\/td>\n
Lior Eldar<\/td>\n<\/tr>\n
3:45 \u2013 4:15<\/td>\n\n
Quantum Simulations of Continuous-Variable Quantum Systems<\/div>\n<\/td>\n
Rolando Somma<\/td>\n<\/tr>\n
4:20 \u2013 4:50<\/td>\n\n
Investigating Biological Nitrogen Fixation Using a Quantum Computer<\/div>\n<\/td>\n
Nathan Wiebe<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Opens in a new tab<\/span><\/p>\n

\t

\n\t\t\t\t\t
\n\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\t\tExpand all\t\t\t\t\t<\/button>\n\t\t\t\t\t | <\/span>\n\t\t\t\t\t\n\t\t\t\t\t\tCollapse all\t\t\t\t\t<\/button>\n\t\t\t\t<\/div>\n\t\t\t<\/div>\n\t\t\t\t