Quantum Theory from Principles, Quantum Software from Diagrams
arXiv:2101.03608
Abstract
This thesis consists of two parts. The first part is about how quantum theory can be recovered from first principles, while the second part is about the application of diagrammatic reasoning, specifically the ZX-calculus, to practical problems in quantum computing. The main results of the first part include a reconstruction of quantum theory from principles related to properties of sequential measurement and a reconstruction based on properties of pure maps and the mathematics of effectus theory. It also includes a detailed study of JBW-algebras, a type of infinite-dimensional Jordan algebra motivated by von Neumann algebras. In the second part we find a new model for measurement-based quantum computing, study how measurement patterns in the one-way model can be simplified and find a new algorithm for extracting a unitary circuit from such patterns. We use these results to develop a circuit optimisation strategy that leads to a new normal form for Clifford circuits and reductions in the T-count of Clifford+T circuits.
arXiv commentPhD Thesis. Part A is 135 pages. Part B is 95 pages
References in corpus (86)
- A variational eigenvalue solver on a quantum processor
- Elementary gates for quantum computation
- Surface codes: Towards practical large-scale quantum computation
- Quantum Teleportation is a Universal Computational Primitive
- Measurement-based quantum computation with cluster states
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Improved Simulation of Stabilizer Circuits
- Experimental One-Way Quantum Computing
- Quantum computation with ions in thermal motion
- Multi-party entanglement in graph states
- High-fidelity quantum logic gates using trapped-ion hyperfine qubits
- High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions
- Information Causality as a Physical Principle
- The Resource Theory of Quantum States Out of Thermal Equilibrium
- Informational derivation of Quantum Theory
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- High-Fidelity Universal Gate Set for Be Ion Qubits
- Quantum Theory From Five Reasonable Axioms
- 18-qubit entanglement with photon's three degrees of freedom
- Probabilistic theories with purification
- Quantum advantage with shallow circuits
- Characterizing quantum theory in terms of information-theoretic constraints
- Graphical description of the action of local Clifford transformations on graph states
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Halving the cost of quantum addition
- Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
- Measurement-based quantum computation beyond the one-way model
- Quantum circuits of T-depth one
- Unsupervised Machine Learning on a Hybrid Quantum Computer
- From three-photon GHZ states to ballistic universal quantum computation
- Novel constructions for the fault-tolerant Toffoli gate
- Scalable quantum circuit and control for a superconducting surface code
- The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
- Reducing T-count with the ZX-calculus
- Determinism in the one-way model
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Parallelizing Quantum Circuits
- Towards Large-scale Functional Verification of Universal Quantum Circuits
- Limited Holism and Real-Vector-Space Quantum Theory
- Quantum theory from questions
- Both Toffoli and Controlled-NOT need little help to do universal quantum computation
- Generalized Probabilistic Theories Without the No-Restriction Hypothesis
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- There and back again: A circuit extraction tale
- Diagonal gates in the Clifford hierarchy
- A Depth-Optimal Canonical Form for Single-qubit Quantum Circuits
- Distillation of local purity from quantum states
- ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
- On the qubit routing problem
- A bridge to lower overhead quantum computation
- A universal completion of the ZX-calculus
- Quantum Logic in Dagger Kernel Categories
- Exact and practical pattern matching for quantum circuit optimization
- Finding Optimal Flows Efficiently
- Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
- How Interference Effects in Mixtures Determine the Rules of Quantum Mechanics
- Four and a Half Axioms for Finite Dimensional Quantum Mechanics
- Invertible Quantum Operations and Perfect Encryption of Quantum States
- Ruling out higher-order interference from purity principles
- Universal MBQC with generalised parity-phase interactions and Pauli measurements
- Terminality implies non-signalling
- Uniqueness and order in sequential effect algebras
- Optimization of Clifford Circuits
- Which graph states are useful for quantum information processing?
- Graphical description of the action of Clifford operators on stabilizer states
- Physical-depth architectural requirements for generating universal photonic cluster states
- Hypergraph Simplification: Linking the Path-sum Approach to the ZH-calculus
- Global Quantum Circuit Optimization
- Entanglement as an axiomatic foundation for statistical mechanics
- Quotient-Comprehension Chains
- An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation
- The Category of Von Neumann Algebras
- A universal property for sequential measurement
- Strongly symmetric spectral convex bodies are Jordan algebra state spaces
- Quantum Theory is a Quasi-stochastic Process Theory
- Dagger and Dilation in the Category of Von Neumann algebras
- Computation at a distance
- Graphical Fourier Theory and the Cost of Quantum Addition
- Categorical Operational Physics
- Commutativity in Jordan Operator Algebras
- Compact quantum circuits from one-way quantum computation
- Completeness of the Phase-free ZH-calculus
- Convex and Sequential Effect Algebras
- Effectuses in Categorical Quantum Foundations
- An algebraic semi-automated proof of the fundamental identity of Jordan algebras
- Pure Maps between Euclidean Jordan Algebras