A Monomial Matrix Formalism to Describe Quantum Many-body States Speaker(s): Maarten Van den Nest
Abstract: We propose a framework to describe and simulate a class of many-body quantum states. We do so by considering joint eigenspaces of sets of monomial unitary matrices, called "M-spaces"; a unitary matrix is monomial if precisely one entry per row and column is nonzero. We show that M-spaces encompass v... read more
Date: 16/04/2012 - 4:00 pm
Series: Quantum Information
|
Classical Simulations of Quantum Fourier Transforms and Normalizer Circuits Over Abelian Groups Speaker(s): Maarten Van den Nest
Abstract: TBA
Date: 12/04/2012 - 10:30 am
Collection: Recent Progress in Quantum Algorithms - 2012
|
PIRSA:11070098
( Flash Presentation , Windows Presentation , Windows Video File , MP3 , PDF) Which Format?
Mathematica Presentations Speaker(s): Maarten Van den Nest
Abstract:
Date: 31/07/2011 - 7:45 pm
Collection: Mathematica Summer School - 2011
|
PIRSA:08040047
( Flash Presentation , Windows Presentation , Windows Video File , MP3 , PDF) Which Format?
Quantum information, graphs, and statistical mechanics Speaker(s): Maarten Van den Nest
Abstract: We give an overview of several connections between topics in quantum information theory, graph theory, and statistical mechanics. The central concepts are mappings from statistical mechanical models defined on graphs, to entangled states of multi-party quantum systems. We present a selection of such... read more
Date: 28/04/2008 - 2:00 pm
|
PIRSA:07090000
( Flash Presentation , Windows Presentation , Windows Video File , MP3 , PDF) Which Format?
Mapping classical spin models to the graph state formalism Speaker(s): Maarten Van den Nest
Abstract: In this talk we discuss how large classes of classical spin models, such as the Ising and Potts models on arbitrary lattices, can be mapped to the graph state formalism. In particular, we show how the partition function of a spin model can be written as the overlap between a graph state and a comple... read more
Date: 12/09/2007 - 4:00 pm
|