Dear quanta,
We will meet tomorrow at the usual time and place (11am, 6-310). Peter will
tell us about his work on quantum money.
-aram
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
Dear quanta,
I am speaking tomorrow at Harvard on my recent paper with John, Rolando +
Caltech people on simulating 2D random circuits. Below is the announcement.
-aram
----
Hi All,
Here is the notice for the Mathematical Picture Language Seminar on
Tuesday, January 28 at 3:30 p.m.
I attach the flyer, and include the details below in case you don’t want to
access the attachment:
3:30 PM
Tuesday, January 28, 2020
Harvard University
Mathematical Picture Language Seminar
Jefferson 356
“Phase transitions in the complexity of simulating random shallow quantum
circuits”
Aram Harrow, MIT
*Abstract:* The appeal of quantum computing is based on the fact that
simulating N quantum systems on a classical computer takes time
exponential in N. This exponential hardness is known to hold even for
shallow quantum circuits, meaning unitary dynamics that run for a
constant amount of time. We show that when the quantum circuits are made
of random gates on a 2D geometry, they are not always exponentially hard to
simulate. Instead, we give evidence for a phase transition in
computational difficulty as the depth and local dimension are varied. Our
evidence consists of (1) fast classical simulations of random circuits on a
400x400 grid of qubits, (2) a mapping to the order/disorder transition in
an associated stat mech model, and (3) a proof that some circuit families
are easy to simulate approximately but hard to simulate exactly. Our
algorithms are based on tensor network contraction and mapping the 2D
random unitary circuit to a 1D process consisting of alternating rounds of
random local unitaries and weak measurements.
This is based on https://arxiv.org/abs/2001.00021
<https://urldefense.proofpoint.com/v2/url?u=https-3A__arxiv.org_abs_2001.000…>
which is joint work with John Napp, Rolando La Placa, Alexander Dalzell,
and Fernando Brandao.
Barbara Drauschke, assistant to A. Jaffe
617-495-2895
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
Dear quanta,
A reminder that we will meet at 11 today in the usual place. After we have
been hearing so much about the undecidability of entangled games, Adam will
tell us some positive news about algorithms.
aram
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
Dear quanta,
I think we will try a different time for the seminar this spring. Can you
all please email me the list of times that you have conflicts?
thanks,
aram
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
Dear quanta,
This Friday Adam will speak about his recent work on algorithms for
entangled games.
-aram
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
some of the talks at this workshop may be of interest to this list.
---------- Forwarded message ---------
From: Philippe Rigollet <rigollet(a)math.mit.edu>
Date: Sat, Jan 18, 2020 at 12:28 PM
Subject: [Lids-seminars] MIFODS Workshop on Learning under a Complex
Structure. Jan. 27-29, MIT campus, Room 1-190
To: <stat-global(a)mit.edu>
*Workshop on Learning under a Complex Structure*
Date: Monday, January 27 – Wednesday, January 29, 2020
Location: room 1-190 with a poster session in room 2-290 on Tue. Jan. 28 at
4pm.
The MIT Institute for Foundations of Data Science (MIFODS) center is
organizing a workshop on learning under a complex structure, to be held at
MIT on January 27-29, 2019.
More details, including the final schedule and registration instructions,
can be found here: http://mifods.mit.edu/complex.php
Yours sincerely,
The organizers: Costis Daskalakis, Stefanie Jegelka, Jonathan Kelner, Ankur
Moitra and Philippe Rigollet
--
Philippe Rigollet
www-math.mit.edu/~rigollet
_______________________________________________
Lids-seminars mailing list
Lids-seminars(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/lids-seminars
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
Dear quanta,
This is a reminder that we will meet at 11 in 6-310. Zack will tell us
about quantum finite automata.
-aram
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
Dear quanta,
We resume group meeting this Friday. Zack Remscrim will tell us about his
work on quantum finite automata.
Coming up, our plans for future weeks are Adam on Jan 24 speaking about
macroscopic Bell inequalities, and Rolando on Jan 31 speaking about quantum
crypto.
aram
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip
Dear all,
As a reminder, the Roy Glauber Memorial Workshop<https://projects.iq.harvard.edu/royglaubermw2020> will take place today, January 15, in the Harvard Physics Department. We hope you will join in celebrating the legacy of Prof. Glauber. An overview of the schedule is below and a full schedule is attached.
8:45 AM - 10:30 AM -- Jefferson 250
Welcome
Talk 1: Dr. Peter Zoller
Talk 2: Dr. Jun Ye
10:30 AM -- Coffee Break -- Jefferson 250
10:50 AM 1:00 PM -- Jefferson 250
Talk 3: Dr. Ignacio Cirac
Talk 4: Dr. Chris Monroe
Talk 5: Dr. Steven Girvin
1:00 PM -- Lunch -- Jefferson 450
2:00 - 3:30 PM -- Jefferson 250
Talk 6: Dr. Nergis Mavalvala
Talk 7: Dr. Marlan Scully
3:30 - 4:30 PM -- Jefferson 450
Memories on the scientific Legacy of Roy Glauber
4:30 PM - 6:30 PM -- Poster Session -- Jefferson 450
·
--
Clare Ploucha
Director of Programs
Harvard Quantum Initiative
Max Planck/Harvard Research Center for Quantum Optics
18 Hammond Street, Palfrey 105
Cambridge, MA 02138
P: 617-495-3388
see below for a job ad for Microsoft summer internships.
*We are looking for exceptional people! Please pass the following
information to potential candidates.*
Microsoft Quantum
<https://nam06.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.micro…>
is looking for exceptional internship candidates. Positions are
available beginning in the spring/summer/fall of 2020. We are seeking
candidates with a strong background in areas such as quantum algorithms,
software engineering, quantum circuit synthesis, physics device modeling
and characterization, quantum chemistry, quantum error correction, machine
learning and quantum-inspired optimization.
*Internship Application deadline: January 31, 2020*
Do you want to be part of the next revolution in computing? Put curiosity
and theory into practice and join our vibrant Microsoft Quantum team as an
intern! During the 12-week internship, you will work alongside some of the
world’s best researchers and software developers. You will learn new
skills, make exciting discoveries, and will have opportunities to network
and make connections for life.
We are looking for exceptional candidates for internships in research and
engineering to work on areas such as quantum algorithms, quantum error
correction, optimization, tools development, programming, and more.
Positions are available beginning in spring/summer/fall of 2020.
Visit the following links to apply today:
https://careers.microsoft.com/us/en/job/756936/Research-Intern-Quantum-Comp…
<https://nam06.safelinks.protection.outlook.com/?url=https%3A%2F%2Fcareers.m…>
https://careers.microsoft.com/us/en/job/756934/Research-Intern-Quantum-Prog…
<https://nam06.safelinks.protection.outlook.com/?url=https%3A%2F%2Fcareers.m…>
Application materials should include:
- Current CV
- Letters of reference. (A minimum of 2 references required)
- Brief statement of research interests and expertise
*Microsoft is an equal opportunity employer (EOE) and strongly supports
diversity in the workforce.*
Direct questions to martinro AT microsoft DOT com
_______________________________________________
qip mailing list
qip(a)mit.edu
http://mailman.mit.edu/mailman/listinfo/qip