Conference

Displaying 2533 - 2544 of 4881

Contextuality as a Litmus Test for Quantum Weirdness

Matthew Pusey University of York

October 22, 2014

PIRSA:14100106
Axions: an ideal cosmological probe of fundamental physics

David Marsh King's College London

October 22, 2014

PIRSA:14100105
A Mathematician Looks at Supergravity and AdS/CFT

Kevin Costello

October 22, 2014

PIRSA:14100104
Fundamental Physics Without Colliding Particles

Asimina Arvanitaki Perimeter Institute

October 22, 2014

PIRSA:14100103
Spatially coupled quantum LDPC codes

Jean-Pierre Tillich

July 16, 2014

PIRSA:14070015
Measuring the overhead of a quantum error correcting code

Austin Fowler Institute for Quantum Computing (IQC)

July 16, 2014

PIRSA:14070014
Homological product codes

Sergey Bravyi IBM (United States)

July 16, 2014

PIRSA:14070013
Gauge color codes

Hector Bombin PsiQuantum Corp.

July 16, 2014

PIRSA:14070012
Is scalable quantum error correction realistic? Some projects, thoughts and open questions.

Barbara Terhal Delft University of Technology

July 15, 2014

PIRSA:14070010
TBA

John Preskill California Institute of Technology (Caltech) - Division of Physics Mathematics & Astronomy

July 15, 2014

PIRSA:14070009
Quantum codes – from experimental realizations to quantum foundations

Robert Raussendorf University of British Columbia

July 15, 2014

PIRSA:14070008
Injectivity radius bounds on the minimum distance of quantum LDPC codes

July 15, 2014

PIRSA:14070007

Contextuality as a Litmus Test for Quantum Weirdness

Matthew Pusey University of York

October 22, 2014

PIRSA:14100106
Axions: an ideal cosmological probe of fundamental physics

David Marsh King's College London

October 22, 2014

PIRSA:14100105
A Mathematician Looks at Supergravity and AdS/CFT

Kevin Costello

October 22, 2014

PIRSA:14100104
Fundamental Physics Without Colliding Particles

Asimina Arvanitaki Perimeter Institute

October 22, 2014

PIRSA:14100103
Spatially coupled quantum LDPC codes

Jean-Pierre Tillich

July 16, 2014

PIRSA:14070015

Spatially coupled LDPC were introduced by Felström and Zigangirov in 1999. They might be viewed in the following way, take several several instances of a certain LDPC code family, arrange them in a row and then mix the edges of the codes randomly among neighboring layers. Moreover fix the bits of the first and last layers to zero. It has soon been found out that iterative decoding behaves much better for this code than for the original LDPC code. A breakthrough occurred when it was proved by Kudekar, Richardson and Urbanke that these codes attain the capacity of all binary input memoryless output-symmetric channels.

All these nice features of classical spatially coupled LDPC codes suggest to study whether they have a quantum analogue. The fact that spatially coupled LDPC codes may afford to have large degrees and still perform well under iterative decoding would be quite interesting in the quantum setting, since by the very nature of the quantum construction of stabilizer codes the rows of the parity-check matrix of the quantum code have to belong to the code which is decoded by the iterative decoder. This implies that we should have rather large row weights to avoid severe error-floor phenomena and/or oscillatory behavior of iterative decoding which degrades significantly its performance.

With Andriyanova and Maurice, I showed last year that it is possible to come up with coupled versions of quantum LDPC codes that perform excellently under iterative decoding. For instance we have constructed a spatially coupled LDPC code family of rate $\approx \frac{1}{4}$ which performs well under iterative decoding even for noise values close to the hashing bound $p \approx 0.127$.
This represents a tremendous improvement over all previous known families of quantum LDPC codes of the same rate.
I will discuss in this talk what can be expected from this approach when these spatially coupled LDPC codes are used for performing fault tolerant computation.
Measuring the overhead of a quantum error correcting code

Austin Fowler Institute for Quantum Computing (IQC)

July 16, 2014

PIRSA:14070014

If one's goal is large-scale quantum computation, ultimately one wishes to minimize the amount of time, number of qubits, and qubit connectivity required to outperform a classical system, all while assuming some physically reasonable gate error rate. We present two examples of such an overhead study, focusing on the surface code with and without long-range interactions.
Homological product codes

Sergey Bravyi IBM (United States)

July 16, 2014

PIRSA:14070013

All examples of quantum LDPC codes known to this date suffer from a poor distance scaling limited by the square-root of the code length. This is in a sharp contrast with the classical case where good LDPC codes are known that combine constant encoding rate and linear distance. In this talk I will describe the first family of good quantum "almost LDPC" codes. The new codes have a constant encoding rate, linear distance, and stabilizers acting on at most square root of n qubits, where n is the code length. For comparison, all previously known families of good quantum codes have stabilizers of linear weight. The proof combines two techniques: randomized constructions of good quantum codes and the homological product operation from algebraic topology. We conjecture that similar methods can produce good quantum codes with stabilizer weight n^a for any a>0. Finally, we apply the homological product to construct new small codes with low-weight stabilizers.

This is a joint work with Matthew Hastings
Preprint: arXiv:1311.0885
Gauge color codes

Hector Bombin PsiQuantum Corp.

July 16, 2014

PIRSA:14070012

I will describe a new class of topological quantum error correcting codes with surprising features. The constructions is based on color codes: it preserves their unusual transversality properties but removes important drawbacks. In 3D, the new codes allow the effectively transversal implementation of a universal set of gates by gauge fixing, while error-dectecting measurements involve only 4 or 6 qubits. Furthermore, they do not require multiple rounds of error detection to achieve fault-tolerance.
Is scalable quantum error correction realistic? Some projects, thoughts and open questions.

Barbara Terhal Delft University of Technology

July 15, 2014

PIRSA:14070010
TBA

John Preskill California Institute of Technology (Caltech) - Division of Physics Mathematics & Astronomy

July 15, 2014

PIRSA:14070009
Quantum codes – from experimental realizations to quantum foundations

Robert Raussendorf University of British Columbia

July 15, 2014

PIRSA:14070008

This talk is divided into two parts. In the first part, I discuss a scheme of fault-tolerant quantum computation for a web-like physical architecture of a quantum computer. Small logical units of a few qubits (realized in ion traps, for example) are linked via a photonic interconnect which provides probabilistic heralded Bell pairs [1]. Two time scales compete in this system, namely the characteristic decoherence time T_D and the typical time T_E it takes to provide a Bell pair. We show that, perhaps unexpectedly, this system can be used for fault-tolerant quantum computation for all values of the ratio T_D/T_E.

The second part of my talk is about something entirely different, namely the role of contextuality in quantum computation by magic state distillation. Recently, Howard et al. [2] have shown that contextuality is a necessary resource for such computation on qudits of odd prime dimension. Here we provide an analogous result for 2-level systems.
However, we require them to be rebits. [joint work with Jake Bian, Philippe Guerin and Nicolas Delfosse]

[1] C. Monroe, R. Raussendorf, A. Ruthven, K. R. Brown, P. Maunz4, L.-M.
Duan, and J. Kim, , Phys Rev A 89, 22317 (2014).

[2] Mark Howard, Joel Wallman, Victor Veitch & Joseph Emerson, Nature
doi:10.1038/nature13460 (2014).
Injectivity radius bounds on the minimum distance of quantum LDPC codes

July 15, 2014

PIRSA:14070007

Only a rare number of constructions of quantum LDPC codes are equipped with an unbounded minimum distance. Most of them are inspired by Kitaev toric codes constructed from the a tiling of the torus such as, color codes which are based on 3-colored tilings of surfaces, hyperbolic codes which are defined from hyperbolic tilings, or codes based on higher dimensional manifolds. These constructions are based on tilings of surfaces or manifolds and their parameters depend on the homology of the tiling.

In the first part of this talk, we recall homological bounds on the parameters of these quantum LDPC codes. In particular, the injectivity radius of the tiling provides a general lower bound on the minimum distance of these quantum LDPC codes.

Then, we extend the injectivity radius method to bound the minimum distance of a family of quantum LDPC codes based on Cayley graphs.
Finally, we improve these results by studying a notion of expansion of these Cayley graphs.

This talk is based on a joint work with Alain Couvreur and Gilles Zémor, and a joint work with Zhentao Li and Stephan Tommassé.

Title	Speaker(s)	Date	Talk Type	Info link
Contextuality as a Litmus Test for Quantum Weirdness	Matthew Pusey	2014-10-22	Conference	View details
Axions: an ideal cosmological probe of fundamental physics	David Marsh	2014-10-22	Conference	View details
A Mathematician Looks at Supergravity and AdS/CFT	Kevin Costello	2014-10-22	Conference	View details
Fundamental Physics Without Colliding Particles	Asimina Arvanitaki	2014-10-22	Conference	View details
Spatially coupled quantum LDPC codes	Jean-Pierre Tillich	2014-07-16	Conference	View details
Measuring the overhead of a quantum error correcting code	Austin Fowler	2014-07-16	Conference	View details
Homological product codes	Sergey Bravyi	2014-07-16	Conference	View details
Gauge color codes	Hector Bombin	2014-07-16	Conference	View details
Is scalable quantum error correction realistic? Some projects, thoughts and open questions.	Barbara Terhal	2014-07-15	Conference	View details
TBA	John Preskill	2014-07-15	Conference	View details
Quantum codes – from experimental realizations to quantum foundations	Robert Raussendorf	2014-07-15	Conference	View details
Injectivity radius bounds on the minimum distance of quantum LDPC codes		2014-07-15	Conference	View details

Supported by

Format results

Contextuality as a Litmus Test for Quantum Weirdness

Axions: an ideal cosmological probe of fundamental physics

A Mathematician Looks at Supergravity and AdS/CFT

Fundamental Physics Without Colliding Particles

Spatially coupled quantum LDPC codes

Measuring the overhead of a quantum error correcting code

Homological product codes

Gauge color codes

Is scalable quantum error correction realistic? Some projects, thoughts and open questions.

TBA

Quantum codes – from experimental realizations to quantum foundations

Injectivity radius bounds on the minimum distance of quantum LDPC codes

Contextuality as a Litmus Test for Quantum Weirdness

Axions: an ideal cosmological probe of fundamental physics

A Mathematician Looks at Supergravity and AdS/CFT

Fundamental Physics Without Colliding Particles

Spatially coupled quantum LDPC codes

Measuring the overhead of a quantum error correcting code

Homological product codes

Gauge color codes

Is scalable quantum error correction realistic? Some projects, thoughts and open questions.

TBA

Quantum codes – from experimental realizations to quantum foundations

Injectivity radius bounds on the minimum distance of quantum LDPC codes