Upcoming Quantum Information Talks

Wed, 2018-06-13 10:00 - 11:00
S H Lau ( VP Business Development, Sigray, Inc.)

While X-ray techniques within synchrotron are undoubtedly powerful, they tend to be signifcantly oversubscribed, severely limiting access to the majority of researchers. X-ray instruments in a laboratory format, are generally subject to various limitations.

Fri, 2018-04-20 02:00 - 03:00
Warit Asavanant, University of Tokyo

Quantum computation on optical platform possesses many advantages over other physical systems such as ability to perform computation at room temperature and affinity with telecommunication. However, in the physical implementation of the usual quantum circuit model, optical quantum computation lacks scalability and programmability which obstruct the realization of usable optical quantum computer. In one-way quantum computation with time-domain multiplexing (TDM), this obstacle can be overcome, thus it opens a way to realize optical quantum computation.

Mon, 2017-02-20 01:30 - 02:30
Oleksandr Kyriienko, Niels Bohr Institute, Copenhagen, Denmark

The general goal of a quantum simulator is to mimic the behaviour of a system of interest using another well-controlled quantum setup. Offering a potential to solve classically intractable quantum problems, it will allow to study complex quantum systems and answer fundamental questions of nature. This is also of vast importance from the applied point of view, with examples being an optimization of molecular processes and description of strongly correlated materials.

Tue, 2016-01-19 14:00 - 15:00
Sam Roberts, University of Sydney, Australia

Characterising physically realistic spin systems that are useful for quantum computation and also robust to noise is a central problem in quantum information theory. The cluster state in 3-dimensions is the gapped ground state of a local Hamiltonian which exhibits some remarkable properties, including infinite entanglement length at nonzero temperatures [Raussendorf et al. Phys. Rev. A 71, 062313, (2005)]. A natural question to ask is whether there is an ordered phase where some of these properties are insensitive to perturbations.

Tue, 2016-01-19 10:00 - 11:00
Rafael Alexander, University of Sydney, Australia

Provided that they can be made really big, quantum computers can offer impressive speedups over their classical counterparts. Such computations can be implemented using only single-site operations on large entangled cluster states (this is known as measurement-based quantum computation). Though continuous-variable cluster states can be generated on an unprecedented scale using current quantum optics technology, a major bottleneck hindering their use is the noise that arises from having limited squeezing resources.

Fri, 2015-04-17 10:00 - 11:00
Dongsheng Wang, University of Calgary
Quantum simulation is one of the earliest motivations for quantum computing, and has been established as an important application of quantum computers. So far the focus of quantum simulation is mainly on Hamiltonian-driven evolution for locally interacting systems, here we extend the quantum simulation tasks to more general quantum dynamics described as quantum channels, and establish the novel framework of algorithmic quantum channel simulation.
Mon, 2014-07-28 15:00 - 16:00
Tzu-Chieh Wei, Stony Brook
I will introduce a geometric measure of entanglement to quantify entanglement in toric code ground states. It turns out that the geometric entanglement exhibits a bulk law and an additional constant, the latter being the same as the topological entanglement entropy. A string tension can be applied to frustrate large loop configuration in the toric code ground state, and when the tension is sufficiently large, the wavefunction becomes a trivial product state. Somewhere in between the exact toric code ground state and the trivial product state, there must exist a phase transition.
Tue, 2014-03-25 14:00 - 15:00
Mark Howard, IQC Waterloo
Quantum information enables dramatic new advantages for computation, such as Shor's factoring algorithm and quantum simulation algorithms. This naturally raises the fundamental question: what unique resources of the quantum world enable the advantages of quantum information? There have been many attempts to answer this question, with proposals including the hypothetical "quantum parallelism" some associate with quantum superposition, the necessity of large amounts of entanglement, and much ado about quantum discord.
Fri, 2014-03-14 10:00 - 11:00
Nicolas Delfosse, Universite de Sherbrooke
Surface codes and color codes are two families of quantum error correcting codes which are particularly well suited to fault-tolerant quantum computing. They are defined by local constraints on qubits placed on a surface and they allow for efficient decoding. In this talk, we present a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes.
Thu, 2013-04-04 10:00 - 11:00
Kamil Michnicki, MIT
A high energy barrier for logical errors in local stabilizer code Hamiltonians is essential for the development of self-correcting quantum memories. These devices would have an unbounded storage time as a function of the total number of qubits. We introduce a new primitive, called welding, for combining two stabilizer codes to produce a new stabilizer code for which the resulting shape of the logical operators is the combination of the former two shapes.
Website development by Checkmark Media. Designed by Armada.

a place of mind, The University of British Columbia

Faculty of Science
Department of Physics and Astronomy
6224 Agricultural Road
Vancouver, BC V6T 1Z1
Tel 604.822.3853
Fax 604.822.5324

Emergency Procedures | Accessibility | Contact UBC | © Copyright The University of British Columbia