Quantum Physics

Displaying 1405 - 1416 of 2186

Tensor Networks: an Overview

Lukasz Cincio Los Alamos National Laboratory
April 25, 2013

PIRSA:13040131
Quantum Physics
The continuum limit of tensor networks: a path integral representation

David Jennings Imperial College London
April 22, 2013

PIRSA:13040113
Quantum Physics
The theory of composition in physics

Lucien Hardy Perimeter Institute for Theoretical Physics
April 16, 2013

PIRSA:13040121
Quantum Physics
Continuous-variable entanglement distillation and non-commutative central limit theorems

Earl Campbell University of Sheffield
April 15, 2013

PIRSA:13040122
Quantum Physics
Classical and quantum circuit obfuscation with braids

Stephen Jordan National Institute of Standards & Technology
April 08, 2013

PIRSA:13040111
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 14

David Cory Institute for Quantum Computing (IQC)
April 05, 2013

PIRSA:13040037
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 13

David Cory Institute for Quantum Computing (IQC)
April 04, 2013

PIRSA:13040036
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 12

David Cory Institute for Quantum Computing (IQC)
April 03, 2013

PIRSA:13040035
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 11

David Cory Institute for Quantum Computing (IQC)
April 02, 2013

PIRSA:13040034
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 10

David Cory Institute for Quantum Computing (IQC)
April 01, 2013

PIRSA:13040033
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 9

David Cory Institute for Quantum Computing (IQC)
March 28, 2013

PIRSA:13030064
Quantum Physics
Quoins versus Coins

Terry Rudolph Imperial College London
March 27, 2013

PIRSA:13030000
Quantum Physics

Tensor Networks: an Overview

Lukasz Cincio Los Alamos National Laboratory
April 25, 2013

PIRSA:13040131
Quantum Physics
Tensor network algorithms provide highly competitive tools for analyzing ground state properties of quantum lattice models in one and two spatial dimensions. The most notable examples involve matrix product states, projected entangled pair states and multiscale entanglement renormalization ansatz. The key underlying idea of all the approaches is to decompose a quantum many-body state into a carefully chosen network of tensors.
In this talk I will give an introduction to the subject and show how tensor networks can be used to characterize topological order.
The continuum limit of tensor networks: a path integral representation

David Jennings Imperial College London
April 22, 2013

PIRSA:13040113
Quantum Physics
I will discuss a path-integral representation of continuum tensor networks that extends the continuous MPS class for 1-D quantum fields to arbitrary spatial dimensions while encoding desirable symmetries. The physical states can be interpreted as arising through a continuous measurement process by a lower dimensional virtual field with Lorentz symmetry. The resultant physical states naturally obey entropy area laws, with the expectation values of observables determined by the dissipative dynamics of the boundary field. The class offers the prospect of powerful new analytical and computational tools to describe the physics of strongly interacting field systems.
The theory of composition in physics

Lucien Hardy Perimeter Institute for Theoretical Physics
April 16, 2013

PIRSA:13040121
Quantum Physics
We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such regions joined together). We propose certain fundamental axioms which, it seems, should be satisfied in any theory of composition. A key axiom is the order independence axiom which says we can describe the composition of a composite object in any order. Then we provide a notation for describing composite objects that naturally leads to these axioms being satisfied. In any given physical context we are interested in the value of certain properties for the objects (such as whether the object is possible, what probability it has, how wide it is, and so on). We associate a generalized state with an object. This can be used to calculate the value of those properties we are interested in for for this object. We then propose a certain principle, the composition principle, which says that we can determine the generalized state of a composite object from the generalized states for the components by means of a calculation having the same structure as the description of the generalized state. The composition principle provides a link between description and prediction.
Continuous-variable entanglement distillation and non-commutative central limit theorems

Earl Campbell University of Sheffield
April 15, 2013

PIRSA:13040122
Quantum Physics
Entanglement distillation transforms weakly entangled noisy states into highly entangled states, a primitive to be used in quantum repeater schemes and other protocols designed for quantum communication and key distribution. In this work, we present a comprehensive framework for continuous-variable entanglement distillation schemes that convert noisy non-Gaussian states into Gaussian ones in many iterations of the protocol. Instances of these protocols include the recursive Gaussifier protocol and the pumping Gaussifier protocol. The flexibility of these protocols give rise to several beneficial trade-offs related to success probabilities or memory requirements that can be adjusted to reflect experimental specifics. Despite these protocols involving measurements, we relate the convergence in this protocols to new instances of non-commutative central limit theorems. Implications of the findings for quantum repeater schemes are discussed.
Classical and quantum circuit obfuscation with braids

Stephen Jordan National Institute of Standards & Technology
April 08, 2013

PIRSA:13040111
Quantum Physics
A circuit obfuscator is an algorithm that translates logic circuits into functionally-equivalent similarly-sized logic circuits that are hard to understand. While ad hoc obfuscators have been implemented, theoretical progress has mainly been limited to no-go results. In this work, we propose a new notion of circuit obfuscation, which we call partial indistinguishability. We then prove that, in contrast to previous definitions of obfuscation, partial indistinguishability obfuscation can be achieved by a polynomial-time algorithm. Specifically, our algorithm re-compiles the given circuit using a gate that satisfies the relations of the braid group, and then reduces to a braid normal form. Variants of our obfuscation algorithm can be applied to both classical and quantum circuits.
12/13 PSI - Explorations on Quantum Information Lecture 14

David Cory Institute for Quantum Computing (IQC)
April 05, 2013

PIRSA:13040037
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 13

David Cory Institute for Quantum Computing (IQC)
April 04, 2013

PIRSA:13040036
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 12

David Cory Institute for Quantum Computing (IQC)
April 03, 2013

PIRSA:13040035
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 11

David Cory Institute for Quantum Computing (IQC)
April 02, 2013

PIRSA:13040034
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 10

David Cory Institute for Quantum Computing (IQC)
April 01, 2013

PIRSA:13040033
Quantum Physics
12/13 PSI - Explorations on Quantum Information Lecture 9

David Cory Institute for Quantum Computing (IQC)
March 28, 2013

PIRSA:13030064
Quantum Physics
Quoins versus Coins

Terry Rudolph Imperial College London
March 27, 2013

PIRSA:13030000
Quantum Physics
Human monkeys are used to thinking about the problem of choosing from a set of objects according to some desired, biased, probability distribution. Just think about how you chose your partner(s). Even when it is easy for you to do such a sampling, it can be difficult to do a quantum sampling (Q-Sampling) of the same distribution. By Q-Sampling I mean the creation of a coherent superposition of states of such objects whose amplitudes are the (square roots of) of the specified distribution. In this talk I will discuss what we do know about this problem, why it is interesting, and will discuss how it can let us achieve tasks with quantum information that are provably impossible classically.

Title	Speaker(s)	Date	Talk Type	Info link
Tensor Networks: an Overview	Lukasz Cincio	2013-04-25	Conference	View details
The continuum limit of tensor networks: a path integral representation	David Jennings	2013-04-22	Scientific Series	View details
The theory of composition in physics	Lucien Hardy	2013-04-16	Scientific Series	View details
Continuous-variable entanglement distillation and non-commutative central limit theorems	Earl Campbell	2013-04-15	Scientific Series	View details
Classical and quantum circuit obfuscation with braids	Stephen Jordan	2013-04-08	Scientific Series	View details
12/13 PSI - Explorations on Quantum Information Lecture 14	David Cory	2013-04-05	Course	View details
12/13 PSI - Explorations on Quantum Information Lecture 13	David Cory	2013-04-04	Course	View details
12/13 PSI - Explorations on Quantum Information Lecture 12	David Cory	2013-04-03	Course	View details
12/13 PSI - Explorations on Quantum Information Lecture 11	David Cory	2013-04-02	Course	View details
12/13 PSI - Explorations on Quantum Information Lecture 10	David Cory	2013-04-01	Course	View details
12/13 PSI - Explorations on Quantum Information Lecture 9	David Cory	2013-03-28	Course	View details
Quoins versus Coins	Terry Rudolph	2013-03-27	Scientific Series	View details

Supported by

Format results

Tensor Networks: an Overview

The continuum limit of tensor networks: a path integral representation

The theory of composition in physics

Continuous-variable entanglement distillation and non-commutative central limit theorems

Classical and quantum circuit obfuscation with braids

12/13 PSI - Explorations on Quantum Information Lecture 14

12/13 PSI - Explorations on Quantum Information Lecture 13

12/13 PSI - Explorations on Quantum Information Lecture 12

12/13 PSI - Explorations on Quantum Information Lecture 11

12/13 PSI - Explorations on Quantum Information Lecture 10

12/13 PSI - Explorations on Quantum Information Lecture 9

Quoins versus Coins

Tensor Networks: an Overview

The continuum limit of tensor networks: a path integral representation

The theory of composition in physics

Continuous-variable entanglement distillation and non-commutative central limit theorems

Classical and quantum circuit obfuscation with braids

12/13 PSI - Explorations on Quantum Information Lecture 14

12/13 PSI - Explorations on Quantum Information Lecture 13

12/13 PSI - Explorations on Quantum Information Lecture 12

12/13 PSI - Explorations on Quantum Information Lecture 11

12/13 PSI - Explorations on Quantum Information Lecture 10

12/13 PSI - Explorations on Quantum Information Lecture 9

Quoins versus Coins