Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Tuesday, October 8, 2019 10:00 am - 10:00 am EDT (GMT -04:00)

Phase competition in thin magnetic oxide films: is the dead layer truly “dead”?

Robbyn Trappen, West Virginia University

The family of materials known as complex magnetic oxides have gained a great deal of attention as potential candidates in a number of novel energy saving device applications; however a major barrier to using these materials for their proposed applications has been due to the loss or reduction of magnetism in very thin or small magnetic materials, (typically at surfaces and interfaces) also called the magnetic dead layer problem, which despite extensive research continues to be a challenging issue to resolve.

Tuesday, October 8, 2019 11:00 am - 11:00 am EDT (GMT -04:00)

Efficient Ansatz for Quantum Process Tomography

Luke Govia Raytheon-BBN Technologies

As candidate quantum processors increase both in size and fidelity, so too does the need for robust verification and validation of their operation. Unfortunately, the resource requirements for standard quantum process tomography scales exponentially with the number of qubits, and even for small scale systems, the experimental resource requirements make full tomography very challenging in practice.

Monday, October 21, 2019 12:00 am - Thursday, October 24, 2019 12:00 am GMT (GMT +00:00)

Quantum Innovators in Computer Science and Mathematics

The Quantum Innovators in Computer Science and Mathematics workshop brings together promising researchers working on theoretical aspects of quantum information and computation in computer science and mathematics. 

Talks are open for anyone to attend.

Schedule button

Friday, October 25, 2019 12:00 am - 12:00 am EDT (GMT -04:00)

IQC-IRIF workshop on Quantum Algorithms and Complexity

The one-day workshop is the third in a series that brings together researchers at Institut de Recherche en Informatique Fondamentale (IRIF), Université Paris-Diderot and the Institute for Quantum Computing, University of Waterloo. It will feature a full day of talks on recent progress in quantum algorithms and complexity theory, and related areas, made by members of the two institutions, with the idea to foster collaboration.

Monday, October 28, 2019 2:30 pm - 2:30 pm EDT (GMT -04:00)

Flexible, stretchable and healable bioelectronics

Fabio Cicoira, Department of Chemical Engineering, Polytechnique Montréal, Canada

Organic electronics, based on semiconducting and conducting polymers, have been extensively investigated in the past decades and have found commercial applications in lighting panels, smartphone and TV screens using OLEDs (organic light emitting diodes).

Monday, November 4, 2019 2:30 pm - 2:30 pm EST (GMT -05:00)

Transmitting and Teleporting Quantum-Dot Spin States

John Nichol, University of Rochester

Large-scale arrays of electron spins in gate-defined quantum dots have emerged as key elements of spin-based quantum information processors. Electron spin qubits naturally interact with each other via nearest-neighbor exchange coupling. However, a central requirement for fault-tolerant quantum computing is the ability to transmit quantum states over long distances. In this talk, we discuss the experimental realization of two related approaches to overcoming this obstacle in quantum-dot spin qubits.

Tuesday, November 5, 2019 11:00 am - 11:00 am EST (GMT -05:00)

On Optimality of CSS Codes for Transversal T

Narayanan Rengaswamy, Duke University

In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach to characterize all stabilizer codes for which transversal T and T^{-1} gates preserve the codespace. Our Heisenberg perspective reduces this question to a finite geometry problem that translates to the design of certain classical codes. We prove three corollaries of this result: