[quantum-info] FW: Deadline Approaching: Aspen Winter Conference on Quantum Algorithms

[Daniel Gottesman]

*From:* Krysta Svore [mailto:ksvore at microsoft.com]
*Sent:* November-22-13 4:43 PM
*To:* Krysta Svore
*Subject:* Deadline Approaching: Aspen Winter Conference on Quantum
Algorithms



Dear Quantum Algorithm Enthusiasts,



As a reminder, we invite you to apply for the *Aspen Center for Physics
2014 Winter Conference on Advances in Quantum Algorithms and Computation*,
to be held *March 9-14, 2014*.  The Conference will commence with a Sunday
evening reception, with meetings Monday morning through Friday evening.



*The application deadline is November 30, 2013**.* Please complete your
application at http://www.aspenphys.org*.*  The conference website is at
http://www.aspenphys.org/physicists/winter/2014/quantum/.



To register, please follow the steps below:

1. Click on http://aspenphys.org/db/index.php.

2. Click "Winter Application".

3. Log in or create new account.

4. When prompted, click "Apply" button next to "Advances in Quantum
Algorithms and Computation" listing.

5. Fill in required forms and submit.



**Please send this email and information to others who may be interested.**



This conference highlights topics at the forefront of quantum computing and
underlines the need to foster collaboration and the exchange of ideas among
scientists in order to further the possibility of breakthroughs in quantum
algorithms. With the latest advances in quantum devices and quantum
algorithms, it is an opportune time to discuss the current challenges and
the possibility of breakthrough “killer applications” for a quantum
computer beyond factoring. The primary goal of this winter conference is to
bring together experts from a rich diversity of backgrounds to further the
prospect of revolutions in quantum algorithms, and to discuss the key
challenges in developing new techniques for solving computational problems
on a quantum computer. Quantum algorithms take advantage of methods founded
on the laws of quantum physics and promise computational speed-ups over
classical methods. Most quantum algorithms draw from a small number of
techniques, such as amplitude amplification, quantum annealing, and quantum
phase estimation, and offer fast solutions to problems in a variety of
fields including number theory, database search, physical simulation,
chemistry and physics.



The conference will highlight topics at the forefront of quantum computing
and breakthroughs

in quantum algorithms. Specific topics to be covered at the conference
include:

• Adiabatic Quantum Optimization and Quantum Annealing

• Quantum Walks

• Quantum Algorithms in the Quantum Circuit Model

• Quantum Query Models

• Quantum Simulation of Physical Systems

• Classical Methods for Simulation of Quantum Algorithms

• Quantum Fault Tolerance and Error Correction



The conference will consist of invited talks and poster submissions. Some
poster submissions may be considered for contributed talks.



Invited speakers include:

Scott Aaronson (MIT)

Alan Aspuru-Guzik (Harvard)

Dominic Berry (Macquarie)

Sergey Bravyi (IBM)

Dave Clader (Johns Hopkins)

Bryan Clark (UIUC)

Ed Farhi (MIT)

Jeongwan Haah (MIT)

Matt Hastings (Microsoft Research)

Stephen Jordan (NIST)

Greg Kuperberg (UC Davis)

Daniel Lidar (USC)

David Poulin (Sherbrooke)

Kristen Pudenz (USC)

Ben Reichardt (USC)

Peter Selinger (Dalhousie)

Martin Roetteler (Microsoft Research)

Umesh Vazirani (Berkeley)

James Whitfield (Vienna)

Pawel Wocjan (U. Central Florida)

Wim van Dam (UC Santa Barbara)

Peter Young (UC Santa Cruz)



We hope to see you in Aspen!



Best,

Krysta Svore, Microsoft Research

Aram Harrow, MIT

Matthias Troyer, ETH Zurich
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.uwaterloo.ca/pipermail/quantum-info/attachments/20131122/62a59954/attachment.html>