Format results
-
-
-
Pseudo-random quantum states and operations
Aram Harrow - Massachusetts Institute of Technology (MIT) - Department of Physics
-
Quantum information, graphs, and statistical mechanics
Maarten Van den Nest - Universität Innsbruck
-
Matchgates and the classical simulation of associated quantum circuits
Richard Jozsa - University of Cambridge
-
A unifying view of graph theory in quantum field theory
Achim Kempf - University of Waterloo
-
Statistical Mechanical Models and Topological Color Codes.
Hector Bombin - PsiQuantum Corp.
-
On the Pauli graphs of N-qudits
Michel Planat - FEMTO-ST
-
-
Is there a classical analogue of measurement-based quantum computation?
Dan Browne - University College London (UCL) - Department of Physics & Astronomy
-
-
Some relationships between Quantum Computation and classical statistical physics
Joseph Geraci - University of Southern California (USC)
-
-
Complex Lines
Chris Godsil - University of Waterloo
Certain structures arising in Physics (mub\'s and sic-povm\'s) can be viewed as sets of lines in complex space that are as large as possible, given some simple constraints on the angles between distinct lines. The analogous problems in real space have long been of interest in Combinatorics, because… -
Pseudo-random quantum states and operations
Aram Harrow - Massachusetts Institute of Technology (MIT) - Department of Physics
The idea of pseudo-randomness is to use little or no randomness to simulate a random object such as a random number, permutation, graph, quantum state, etc... The simulation should then have some superficial resemblance to a truly random object; for example, the first few moments of a random… -
Quantum information, graphs, and statistical mechanics
Maarten Van den Nest - Universität Innsbruck
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… -
Matchgates and the classical simulation of associated quantum circuits
Richard Jozsa - University of Cambridge
Some years ago Valiant introduced a notion of \'matchgate\' and \'holographic algorithm\', based on properties of counting perfect matchings in graphs. This provided some new poly-time classical algorithms and embedded in this formalism, he recognised a remarkable class of quantum circuits (arising… -
A unifying view of graph theory in quantum field theory
Achim Kempf - University of Waterloo
A fundamental theorem of quantum field theory states that the generating functionals of connected graphs and one-particle irreducible graphs are related by Legendre transformation. An equivalent statement is that the tree level Feynman graphs yield the solution to the classical equations of motion… -
Statistical Mechanical Models and Topological Color Codes.
Hector Bombin - PsiQuantum Corp.
We find that the overlapping of a topological quantum color code state, representing a quantum memory, with a factorized state of qubits can be written as the partition function of a 3-body classical Ising model on triangular or Union Jack lattices. This mapping allows us to test that different… -
On the Pauli graphs of N-qudits
Michel Planat - FEMTO-ST
A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting pairs of them. As per two-qubits, all basic properties and… -
Yang-Baxter Equations, Extra-special Two-groups and Topological-like Features in Quantum Information Theory
Yong-Shi Wu - University of Utah
Recently a simple but perhaps profound connection has been observed between the unitary solutions of the Yang-Baxter Equations (YBE) and the entangled Bell states and their higher dimensional (or more-qubit) extensions, the generalized GHZ states. We have shown that this connection can be made more… -
Is there a classical analogue of measurement-based quantum computation?
Dan Browne - University College London (UCL) - Department of Physics & Astronomy
Measurement-based quantum computation is unusual among quantum computational models in that it does not have an obvious classical analogue. In this talk, I shall describe some new results which shed some new light on this. In the one-way model [1], computation proceeds by adaptive single-qubit… -
Exotic Phases and Entanglement Properties of Condensed Matter Systems Living on Graphs
Pasquale Sodano - University of Perugia
New and exotic phases as well as remarkable entanglement behaviors emerge in condensed matter systems (and quantum devices) living (fabricated) on graphs. To illustrate this, I will discuss the properties of Josephson junction networks fabricated on comb and star graphs and of spin models living on… -
Some relationships between Quantum Computation and classical statistical physics
Joseph Geraci - University of Southern California (USC)
I will discuss a quantum algorithm for the exact evaluation of the classical Potts partition function for a class of graphs (and hypergraphs) related to a family of classical cyclic codes. I will also present a mapping I recently constructed from quantum circuit instances to graphs and discuss some…