aspuru-list June 2017

aspuru-list@lists.fas.harvard.edu

15 participants
35 discussions

[Aspuru-Guzik Group List] [qip] group meeting tomorrow

by Aram Harrow

Dear quanta, We will meet tomorrow at the usual time and place (6-310, 11am). Steve and Lior will both speak. -aram _______________________________________________ qip mailing list qip(a)mit.edu http://mailman.mit.edu/mailman/listinfo/qip

6 years, 5 months

[Aspuru-Guzik Group List] [qip] group meeting tomorrow

by Aram Harrow

Dear quanta, We will meet tomorrow at the usual time and place (6-310, 11am). Scott Aaronson is here and will tell us about some of his recent results. aram _______________________________________________ qip mailing list qip(a)mit.edu http://mailman.mit.edu/mailman/listinfo/qip

6 years, 5 months

[Aspuru-Guzik Group List] [qip] no group meeting tomorrow

by Aram Harrow

Dear quanta, We will not have a group meeting tomorrow since enough people seem to want to go to this talk (announcement below) instead. It is not quantum, but has relevance to computing amplitudes of quantum circuits. Next week we will have Marcus Appleby tell us about the SIC-POVM problem and algebraic number theory. -aram ---------- Forwarded message ---------- *STOCHASTICS AND STATISTICS SEMINAR* *|* *FRIDAY, March 3 11AM-12PM in Room E18-304 * https://stat.mit.edu/events/alexander-barvinok-u-michigan/ https://whereis.mit.edu/?go=E18 *Title: * Computing partition functions by interpolation *Speaker: * Alexander Barvinok (UMICH) http://www.math.lsa.umich.edu/~barvinok/ *Abstract:* Partition functions are just multivariate polynomials with great many monomials enumerating combinatorial structures of a particular type and their efficient computation (approximation) are of interest for combinatorics, statistics, physics and computational complexity. I’ll present a general principle: the partition function can be efficiently approximated in a domain if it has no complex zeros in a slightly larger domain, and illustrate it on the examples of the permanent of a matrix, the independence polynomial of a graph and, time permitting, the graph homomorphism partition function. *Bio:* Alexander Barvinok is a professor of mathematics at the University of Michigan, Ann Arbor. He is interested in computational complexity and algorithms in algebra, geometry and combinatorics. _______________________________________________ qip mailing list qip(a)mit.edu http://mailman.mit.edu/mailman/listinfo/qip

6 years, 7 months

[Aspuru-Guzik Group List] Fwd: Questions re IC6: Relevant AMO workshop on AI & ML

by Alan Aspuru-Guzik

I would like two volunteers from the group to go to this event. Those interested in ML for materials design roughly described should be there. Ideally one from the proto-Kebotix team and one not. If interested, contact Felix and Siria ASAP Alan Alán Aspuru-Guzik | Professor of Chemistry and Chemical Biology Harvard University | 12 Oxford Street, Room M138 | Cambridge, MA 02138 (617)-384-8188 | http://aspuru.chem.harvard.edu | http://about.me/aspuru > [image: ENERGY.GOV - Office of Energy Efficiency and Renewable Energy] > <http://links.govdelivery.com/track?type=click&enid=ZWFzPTEmbWFpbGluZ2lkPTIw…> > Advanced Manufacturing Office > <http://links.govdelivery.com/track?type=click&enid=ZWFzPTEmbWFpbGluZ2lkPTIw…> > > > > *June 28, 2017 * > Workshop on Artificial Intelligence Applied to Materials Discovery and > Design > > The Advanced Manufacturing Office invites you to the Workshop on > Artificial Intelligence Applied to Materials Discovery and Design from > August 9-10, 2017 in Pittsburgh, Pennsylvania. This workshop aims to bring > together leading scientific and technical experts to discuss opportunities > for advancing the state of the art of artificial intelligence (AI) applied > to materials design and discovery in energy and other materials areas. > > The advent of extraordinary digital machine computational power has led to > the development of innumerable new algorithms and approaches to AI and > machine learning (ML). Such advances have been successfully applied to > areas such as pattern recognition, language translation, and robotics. The > utilization of AI and ML have been recognized as approaches that can > significantly reduce the time and costs of materials discovery and > development, as well as to predict the existence of new materials with > desirable properties and functions for a wide variety of applications. > > The workshop agenda with the speaker list and discussion topics will be > available shortly. Please check our website > <http://links.govdelivery.com/track?type=click&enid=ZWFzPTEmbWFpbGluZ2lkPTIw…> periodically > for updates, and register for the workshop > <http://links.govdelivery.com/track?type=click&enid=ZWFzPTEmbWFpbGluZ2lkPTIw…> > today. > > Sleeping rooms are available at Pittsburgh Marriott City Center at the > group rate of $129 plus taxes (same as government per diem) on a first come > first serve basis. Room reservations > <http://links.govdelivery.com/track?type=click&enid=ZWFzPTEmbWFpbGluZ2lkPTIw…> > *must be made by Tuesday, July 25, 2017.* > >

6 years, 9 months

[Aspuru-Guzik Group List] Workflows Workshop, July 14th, 3pm

by Dorsk, Alexander

Hi All, Ignore if you are not interested in computational workflows. Otherwise... You are invited to a casual workshop on Friday, July 14th about workflows. You may be interested in this workshop if you have projects that involve... A. Creating sequences of related jobs (e.g. "mm_conformers => optimize => singlepoint") B. Creating large numbers of jobs (> 50) C. Distributing jobs across clusters The primary goals of the workshop are... A. to improve current job pipelines B. to develop future pipelines C. to share knowledge within the group about pipelines D. to improve libraries for creating pipelines and workflows The workshop will take place at 3:00PM on July 14th in the Acapulcoplex conference room. (aka New Siberia). If you are interested, just put your name down here: (form takes ~30s to fill-in). https://goo.gl/forms/B9gAPkKPEnY58Wzy1 -Alex

6 years, 9 months

[Aspuru-Guzik Group List] [qip] TALK: Friday 06-30-2017 Adam Bouland: Thesis Defense: The space around BQP

by calendar＠csail.mit.edu

Adam Bouland: Thesis Defense: The space around BQP Speaker: Adam Bouland Host: Scott Aaronson Date: Friday, June 30, 2017 Time: 3:00 PM to 4:30 PM Refreshments Time: 2:45 PM Location: G575 Abstract: This thesis explores the computational power of quantum devices from the perspective of complexity theory. Quantum computers hold the promise of solving many problems - such as factoring integers - exponentially faster than classical computers. The computational power of universal quantum devices is captured by the complexity class BQP, which stands for “bounded-error quantum polynomial time.” We hope that quantum devices will be capable of the full power of BQP in the long term. However, quantum computers are very difficult to build, and therefore the experimental devices of the near future may be incapable of universal quantum computation. As a result, a number of recent works have studied the computational power of “weak” models of quantum computers which lie “below BQP.” The first part of this thesis examines the space "below BQP” and describes a number of sub-universal models of quantum computation which can nevertheless perform sampling tasks which are difficult for classical computers. We show that prior models maintain hardness when their set of quantum operations is restricted, and describe two new models of “weak” quantum computation which also show advantage over classical devices. A major theme in this work is that almost any weak device can perform hard sampling tasks. We find that almost any model which is not universal, but not known to be efficiently classically simulable, admits a speedup over classical computing for sampling tasks under plausible assumptions. This work can be seen as progress towards classifying the power of all restricted quantum gate sets. On the other hand, recent developments in quantum gravity have opened up the possibility of modifying quantum mechanics to resolve the black hole information paradox. Inspired by these debates, the second part of this thesis explores the space “above BQP” - i.e. the power of quantum computers in the presence of modified theories of quantum mechanics. We find that almost all modifications allow for drastically more power than BQP, and find that these speedups may be related to superluminal signaling in these models. Surprisingly, we find one model which is merely just a bit more powerful than BQP. Inspired by this model “just above” BQP, we study and resolve an open problem in classical complexity related to the power of statistical-zero knowledge proof systems. Members of committee: Scott Aaronson, Aram Harrow, Ryan Williams Relevant URL: For more information please contact: Deborah Goodwin, 617.324.7303, <a href="mailto:dlehto@csail.mit.edu">dlehto(a)csail.mit.edu</a> _______________________________________________ qip mailing list qip(a)mit.edu http://mailman.mit.edu/mailman/listinfo/qip

6 years, 9 months

[Aspuru-Guzik Group List] ITAMP Workshop Announcement

by Ploucha, Clare

Dear All: We would like to invite you to the ITAMP workshop on "Charge Impurities in Cold Atomic and Molecular Systems" to be held at Phillips Auditorium at 60 Garden St. on July 19-21, 2017. The organizers of this workshop are Svetlana Kotochigova (NIST & Temple) and Tommaso Calarco (Ulm). Note: There is no registration fee for the local participants, but for us to account for the number of attendees, we ask you to visit https://www.cfa.harvard.edu/itamp-event/charge-impurities-cold-atomic-and-m… and click on the Registration link. Please choose the "payment by check" option, and pick a random check number so that you can complete the registration process. We look forward to seeing you soon at ITAMP. Regards Naomi Tariri

6 years, 9 months

[Aspuru-Guzik Group List] [qip] TALK: Thursday 06-29-2017 Shalev Ben-David: Thesis Defense: Quantum Speedups in Query Complexity

by calendar＠csail.mit.edu

Shalev Ben-David: Thesis Defense: Quantum Speedups in Query Complexity Speaker: Shalev Ben-David Host: Scott Aaronson Date: Thursday, June 29, 2017 Time: 3:00 PM to 4:30 PM Refreshments Time: 2:45 PM Location: G575 Abstract: In this thesis, we study randomized and quantum algorithms in the query complexity model. We investigate when and by how much quantum algorithms provide a speedup over the best possible classical algorithm in the query complexity setting. We introduce a total Boolean function that exhibits a power 2.5 quantum speedup compared to the best possible randomized algorithm. In the process, we introduce the "cheat sheet" method for turning partial Boolean functions into total Boolean functions, and examine some of its other applications. We also study lower bound techniques for randomized algorithms. We introduce a measure called randomized sabotage complexity which lower bounds randomized query complexity and behaves well under compositions. This tool for controlling the randomized query complexity of composed functions combines nicely with the cheat sheet technique, which often features composed functions in its applications. Finally, we characterize the total Boolean functions that exhibit exponential quantum speedups when their domain is restricted to an arbitrarily chosen set. We show that such a "sculpting" of a quantum speedup is possible if and only if the original total function has many inputs with large certificate complexity. Along the way, we also show that functions defined on very small domains or that are very unbalanced can display at most a quadratic quantum speedup. Advisor: Scott Aaronson Committee Members: Aram Harrow and Ryan Williams Relevant URL: For more information please contact: Deborah Goodwin, 617.324.7303, <a href="mailto:dlehto@csail.mit.edu">dlehto(a)csail.mit.edu</a> _______________________________________________ qip mailing list qip(a)mit.edu http://mailman.mit.edu/mailman/listinfo/qip

6 years, 9 months

[Aspuru-Guzik Group List] Group meeting, Thu June 29, 3:30 PM, Div Room

by Ian Kivlichan

Hi all, Tomorrow David will talk at group meeting. See below for his title and abstract. All the best, Ian ----------------- Title: Effective working fluid-bath decoupling at the strong coupling regime Abstract: Heat machines in the strong coupling regime have been proposed to study fundamental thermodynamics questions, and to improve upon the low power produced by the weak coupling counterpart. At weak coupling, the power is proportional to the square of the coupling strength. A fair hypothesis may be that an increase of the coupling strength will produce an increase on the machine output. However, studies of a wide range of different heat machines predict an effective decoupling between the working fluid and strongly coupled baths, reducing the machine output to levels comparable to the weak coupling regime. This effect has been predicted for fermonic and bosonic baths and for a wide range of working fluids that includes single and multiple spins or harmonic oscillator and molecular systems. A diverse variety of theoretical methods has been applied to these models, including the polaron transformation, Holstein Primakoff transformation, non-interacting blip approximation (NIBA), surrogate Hamiltonian approach and reaction coordinate mapping. The wide range of systems and methods shows that the effective decoupling is not an artifact of some approximation, which in turn may indicate that the effective decoupling is a universal property of the strong coupling regime, regardless of the character of the bath, the working fluid or the interaction between them. We continue the exploration of this universality question by studying different heat machines composed of a spin working fluid that interacts with spin baths. In order to better understand strong coupling effects, we first analyze a toy model of a small spin bath and use numerical calculations to extend our results to larger spin baths. Besides addressing the question of universality, and the underlying physical mechanism that produces the working fluid-bath decoupling, we study methods to avoid the effective decoupling by adding an external decoherence source to the spin baths.

6 years, 9 months

[Aspuru-Guzik Group List] [qip] TALK: Friday 06-30-2017 Adam Bouland: Thesis Defense: The space around BQP

by calendar＠csail.mit.edu

6 years, 9 months

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

aspuru-list June 2017