# Lectures on classical simulation of quantum computations – Richard Jozsa

**Lectures on classical simulation of quantum computations**

Dates: Lecture 1, 4 April 2016; Lecture 2, 6 April 2016 (see detailed information below)

**Lecture 1. Theory of Clifford operations.**

Date: Monday, 4 April 2016

Introduction to Pauli and Clifford operations for qudits; construction of the metaplectic representation and the discrete Wigner function; a hidden variable model for Clifford circuits; implications for classical simulability.

Based mainly on ingredients from:

R. Jozsa, M. Van den Nest arXiv:1305.6190

**Lecture 2. Theory of matchgate (MG) computations.**

Venue: CB02.04.010 (Room 10, Level 4, UTS City Campus Building 2), 15 Broadway, Broadway, NSW 2007

Date: Wednesday, 6 April 2016

Introduction to MGs and relation to fermionic modes; MGs and partition functions for some solvable classical spin models; classical simulability of MG circuits with arbitrary input product states, intermediate measurements and adaptive choices of subsequent gates, and multi-line outputs, all being included simultaneously (D. Brod 2016). Further issues if time permits.

Based mainly on ingredients from:

# Seminar announcement: Youming Qiao

**Title:** Quantum matching problems

**Speaker:** Youming Qiao, UTS

**Time/Location:** 2-3pm, 16 March 2016 (Wed) / CB10.02.410, UTS

**Abstract:**We describe two algorithmic problems, both of which can be viewed as quantum analogues of the perfect matching problem on bipartite graphs. Given several square matrices, we are asked to:

The first problem is the well-known polynomial identity testing problem, for which a deterministic efficient solution implies a strong arithmetic circuit lower bound. The second problem has a rich history and has appeared in various forms in a remarkable number of mathematical and computational areas. For example, it is a key problem in the theory of arithmetic circuits with divisions, as recently studied by Hrubeš and Wigderson. After introducing these problems, we will present a couple of ingredients in a recent deterministic efficient algorithm for the second problem. These include a polynomial degree upper bound on generating the ring of matrix semi-invariants, and a linear algebraic analogue of the augmenting path technique.

# Seminar announcement: Mingsheng Ying

# TQC 2016: Berlin, 27-29 September

Forwarded from the organizers:

**CALL FOR PAPERS**

*The 11th Conference on the Theory of Quantum Computation, Communication, and Cryptography – **TQC 2016*

Freie Universität Berlin

Berlin, Germany

27-29 September 2016

http://tqc2016.physik.fu-berlin.de/

This is the eleventh in a series of conferences that aims to bring together the leading researchers in the areas of quantum computation, quantum communication and quantum cryptography. TQC covers all theoretical aspects of quantum information and submissions on these topics are solicited.

Areas of interest include, but are not restricted to:

* quantum algorithms

* models of quantum computation

* quantum complexity theory

* simulation of quantum systems

* quantum cryptography

* quantum communication

* quantum estimation and measurement

* intersection of quantum information and condensed-matter theory

* quantum coding theory

* fault-tolerant quantum computing

* entanglement theory

Important dates:

* Paper/Talk/Early-Poster submission deadline: May 16, 2016

* Decision notification: July 5, 2016

* Final manuscript deadline: July 23, 2016

* Late-Poster submission deadline: August 17, 2016

* Conference: 27-29 September, 2016

Two tracks: Conference(talk + proceedings) and Workshop(talk only). As the goal of TQC is to bring together researchers on all aspects of quantum information, submissions are solicited for two tracks:

* Conference (talk + proceedings): Submissions to this track must be original papers that have not previously appeared in published form. Accepted papers will be presented orally at the conference and will appear in the conference proceedings. The proceedings will be published by the OpenAccess LIPIcs (Leibniz International Proceedings in Informatics).

* Workshop(talk only): We solicit submissions for talk-only papers; accepted submissions will be presented orally at the conference but will not appear in the proceedings. This track allows authors to publish their work elsewhere and accepts already published material.

Programme committee:

* Gorjan Alagic

* Gilles Brassard

* Anne Broadbent (chair)

* André Chailloux

* Giulio Chiribella

* Frédéric Dupuis

* Joseph Fitzsimons

* Steve Flammia

* Sevag Gharibian

* Stacey Jeffery

* Elham Kashefi

* Iordanis Kerenidis

* Xiongfeng Ma

* Laura Mancinska

* Carl Miller

* Mio Murao

* Marco Piani

* Christopher Portmann

* Robert Raussendorf

* Christian Schaffner

* Norbert Schuch

* Peter Selinger

* Jamie Sikora

* Barbara Terhal

* Mark Wilde

Local organising committee (FU Berlin):

* Jens Eisert – chair

* Oliver Buerschaper – co-chair

* Juan Bermejo-Vega

* Dominik Hangleiter

* Albert Werner

* Carolin Wille

* and the entire QMIO group at the FU Berlin

Steering committee:

* Wim van Dam (UCSB)

* Aram Harrow (MIT)

* Yasuhito Kawano (NTT, Tokyo)

* Michele Mosca (IQC, Waterloo and Perimeter Institute)

* Martin Roetteler (Microsoft Research)

* Simone Severini (UCL)

* Vlatko Vedral (Oxford and CQT, Singapore)

For further information, please see http://tqc2016.physik.fu-berlin.de/

# Sydney is ridiculous

Sydney is ridiculously picturesque. I snapped this photo just before going to see “The Daughter” at the open air cinema in the Sydney Botanical Gardens. Stunning venue for watching a movie! #nofilter

## Recent Comments