Видео 83
Просмотров 16 426

Catalysing Completeness and Universality - John van de Wetering

58:51

Quantum Picturalism: Learning Quantum Theory in High School - Lia Yeh

57:14

Qubit-Count Optimization Using ZX-Calculus - Vivien Vandaele

54:00

Minimal Complete ZW-Calculi for Qudit and Mixed Dimensional Systems - Renaud Vilmart

1:39:06

Genons, Double Covers and Fault-tolerant Clifford Gates - Simon Burton

1:17:59

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling

39:07

Towards Faster Quantum Circuit Simulation via Graph Decompositions, GNNs and Reinforcement Learning

Speaker: Alexander Koziell-Pipe
Paper: openreview.net/pdf?id=54060pbCKY
Abstract: In this work, we train a graph neural network with reinforcement learning to more efficiently simulate quantum circuits using the ZX-calculus. Our experiments show a marked improvement in simulation efficiency using the trained model over existing methods that do not incorporate AI. In this way, we demonstrate a machine learning model that can reason effectively within a mathematical framework such that it enhances scientific research in the important domain of quantum computing.
Joint-Work With: Richie Yeung and Matthew Sutcliffe
Presented at the ZX-calculus seminar on the 11th of November 2024.

Видео

Catalysing Completeness and Universality - John van de Wetering

58:51

Catalysing Completeness and Universality - John van de Wetering

Просмотров 66День назад

arXiv: arxiv.org/pdf/2404.09915 Abstract: A catalysis state is a quantum state that is used to make some desired operation possible or more efficient, while not being consumed in the process. Recent years have seen catalysis used in state-of-the-art protocols for implementing magic state distillation or small angle phase rotations. In this paper we will see that we can also use catalysis to pro...

Quantum Picturalism: Learning Quantum Theory in High School - Lia Yeh

57:14

Quantum Picturalism: Learning Quantum Theory in High School - Lia Yeh

Просмотров 19014 дней назад

arXiv: arxiv.org/pdf/2312.03653 Abstract: Quantum theory is often regarded as challenging to learn and teach, with advanced mathematical prerequisites ranging from complex numbers and probability theory to matrix multiplication, vector space algebra and symbolic manipulation within the Hilbert space formalism. It is traditionally considered an advanced undergraduate or graduate-level subject. I...

Qubit-Count Optimization Using ZX-Calculus - Vivien Vandaele

54:00

Qubit-Count Optimization Using ZX-Calculus - Vivien Vandaele

Просмотров 14921 день назад

arXiv: arxiv.org/pdf/2407.10171 Abstract: We propose several methods for optimizing the number of qubits in a quantum circuit while preserving the number of non-Clifford gates. One of our approaches consists in reversing, as much as possible, the gadgetization of Hadamard gates, which is a procedure used by some T-count optimizers to circumvent Hadamard gates at the expense of additional qubits...

Minimal Complete ZW-Calculi for Qudit and Mixed Dimensional Systems - Renaud Vilmart

1:39:06

Minimal Complete ZW-Calculi for Qudit and Mixed Dimensional Systems - Renaud Vilmart

Просмотров 80Месяц назад

arXiv: arxiv.org/pdf/2401.16225 Abstract: The ZW-calculus is a graphical language capable of representing 2-dimensional quantum systems (qubit) through its diagrams, and manipulating them through its equational theory. We extend the formalism to accommodate finite dimensional Hilbert spaces beyond qubit systems. First we define a qudit version of the language, where all systems have the same ar...

Genons, Double Covers and Fault-tolerant Clifford Gates - Simon Burton

1:17:59

Genons, Double Covers and Fault-tolerant Clifford Gates - Simon Burton

Просмотров 92Месяц назад

arXiv: arxiv.org/pdf/2406.09951 Abstract: A great deal of work has been done developing quantum codes with varying overhead and connectivity constraints. However, given the such an abundance of codes, there is a surprising shortage of fault-tolerant logical gates supported therein. We define a construction, such that given an input [[n,k,d]] code, yields a [[2n,2k,≥d]] symplectic double code wi...

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling

39:07

Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling

Просмотров 129Месяц назад

Speaker: Qunsheng Huang (Technical University of Munich) arXiv: arxiv.org/pdf/2408.00354 Abstract: In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for the compilation of quantum circuits for many applications, such as chemistry simulations and quantum machine learning. In this paper, we propose a novel algorithm for the synthesis of trotterize...

ZX and Measurement-Based Quantum Computing

13:13

ZX and Measurement-Based Quantum Computing

Просмотров 135Месяц назад

Speaker: Miriam Backens Slides: drive.google.com/file/d/1D1JhKOH2Cq01D7j1JVrQSAFS7MZ7F90p/view

14:23

ZX and Machine Learning

Просмотров 235Месяц назад

Speakers: Matthew Sutcliffe and Richie Yeung Slides: drive.google.com/file/d/1d1lxihKutoN8zztdHrFluJb07iq3DdGV/view

14:10

ZX and Education

Просмотров 79Месяц назад

Speaker: Lia Yeh

15:41

ZX and Quantum Error Correction

Просмотров 136Месяц назад

Speaker: Aleks Kissinger Slides: www.cs.ox.ac.uk/people/aleks.kissinger/slides/zx/qec24-15min.html

Measurement-Based Quantum Approximate Optimization - Tobias Stollenwerk

43:00

Measurement-Based Quantum Approximate Optimization - Tobias Stollenwerk

Просмотров 1144 месяца назад

arXiv: arxiv.org/pdf/2403.11514 Abstract: Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only continues to improve but also begins to incorporate new features such as mid-circuit measurement and adaptive control, opportunities arise for innovative algorithmic paradigms. In ...

$Constructing NP^{#P}-Complete Problems and #P-Hardness of Circuit Extraction in Phase-Free ZH$ 56:13 $Constructing NP^{#P}-Complete Problems and #P-Hardness of Circuit Extraction in Phase-Free ZH$

Constructing NP^{#P}-Complete Problems and #P-Hardness of Circuit Extraction in Phase-Free ZH

Просмотров 804 месяца назад

Speaker: Piotr Mitosek arXiv: arxiv.org/pdf/2404.10913 Abstract: The ZH calculus is a graphical language for quantum computation reasoning. The phase-free variant offers a simple set of generators that guarantee universality. ZH calculus is effective in MBQC and analysis of quantum circuits constructed with the universal gate set Toffoli H. While circuits naturally translate to ZH diagrams, fin...

Nonunitary Gates Using Measurements Only - Daniel Azses

57:21

Nonunitary Gates Using Measurements Only - Daniel Azses

Просмотров 2044 месяца назад

arXiv: arxiv.org/pdf/2312.17325 Abstract: Measurement-based quantum computation (MBQC) is a universal platform to realize unitary gates, only using measurements which act on a pre-prepared entangled resource state. By deforming the measurement bases, as well as the geometry of the resource state, we show that MBQC circuits always transmit and act on the input state but generally realize nonunit...

Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources&Detectors

58:20

Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources&Detectors

Просмотров 935 месяцев назад

Speaker: Nicolas Heurtel arXiv: arxiv.org/pdf/2402.17693 Abstract: Linear optical circuits can be used to manipulate the quantum states of photons as they pass through components including beam splitters and phase shifters. Those photonic states possess a particularly high level of expressiveness, as they reside within the bosonic Fock space, an infinite-dimensional Hilbert space. However, in t...

Multi-Controlled Phase Gate Synthesis with ZX-Calculus Applied to Neutral Atom Hardware

51:14

Multi-Controlled Phase Gate Synthesis with ZX-Calculus Applied to Neutral Atom Hardware

Просмотров 1555 месяцев назад

Multi-Controlled Phase Gate Synthesis with ZX-Calculus Applied to Neutral Atom Hardware

All Graph State Verification Protocols are Composably Secure - Léo Colisson

1:06:45

All Graph State Verification Protocols are Composably Secure - Léo Colisson

Просмотров 845 месяцев назад

All Graph State Verification Protocols are Composably Secure - Léo Colisson

Speeding Up Classical Simulation of Quantum Circuits with the ZX calculus - Matthew Sutcliffe

1:10:04

Speeding Up Classical Simulation of Quantum Circuits with the ZX calculus - Matthew Sutcliffe

Просмотров 2655 месяцев назад

Speeding Up Classical Simulation of Quantum Circuits with the ZX calculus - Matthew Sutcliffe

Zero-Temperature Entanglement Membranes in Quantum Circuits - Grace M. Sommers

1:11:23

Zero-Temperature Entanglement Membranes in Quantum Circuits - Grace M. Sommers

Просмотров 1216 месяцев назад

Zero-Temperature Entanglement Membranes in Quantum Circuits - Grace M. Sommers

Complete Equational Theories for Classical and Quantum Gaussian Relations - Robert Booth

1:16:25

Complete Equational Theories for Classical and Quantum Gaussian Relations - Robert Booth

Просмотров 1536 месяцев назад

Complete Equational Theories for Classical and Quantum Gaussian Relations - Robert Booth

Optimising T-Count is NP-Hard, but Optimising Parametrised Circuits is Easy - John van de Wetering

1:00:32

Optimising T-Count is NP-Hard, but Optimising Parametrised Circuits is Easy - John van de Wetering

Просмотров 1036 месяцев назад

Optimising T-Count is NP-Hard, but Optimising Parametrised Circuits is Easy - John van de Wetering

Minimal Equational Theories for Quantum Circuits - Alexandre Clément

52:24

Minimal Equational Theories for Quantum Circuits - Alexandre Clément

Просмотров 787 месяцев назад

Minimal Equational Theories for Quantum Circuits - Alexandre Clément

Teaching Small Transformers to Rewrite ZX Diagrams - Richie Yeung

48:58

Teaching Small Transformers to Rewrite ZX Diagrams - Richie Yeung

Просмотров 1287 месяцев назад

Teaching Small Transformers to Rewrite ZX Diagrams - Richie Yeung

1:03:43

Fault-Tolerant Complexes - Yehua Liu

Просмотров 1468 месяцев назад

Fault-Tolerant Complexes - Yehua Liu

Completeness of Qufinite ZXW Calculus, a Graphical Language for Mixed-Dimensional Quantum Computing

39:13

Completeness of Qufinite ZXW Calculus, a Graphical Language for Mixed-Dimensional Quantum Computing

Просмотров 898 месяцев назад

Completeness of Qufinite ZXW Calculus, a Graphical Language for Mixed-Dimensional Quantum Computing

Enriching Diagrams with Algebraic Operations - Alejandro David Villoria Gonzalez

50:35

Enriching Diagrams with Algebraic Operations - Alejandro David Villoria Gonzalez

Просмотров 538 месяцев назад

Enriching Diagrams with Algebraic Operations - Alejandro David Villoria Gonzalez

VyZX: Formal Verification of a Graphical Quantum Language - Ben Caldwell

52:13

VyZX: Formal Verification of a Graphical Quantum Language - Ben Caldwell

Просмотров 1499 месяцев назад

VyZX: Formal Verification of a Graphical Quantum Language - Ben Caldwell

Graphical Symplectic Algebra - Robert Booth

1:09:41

Graphical Symplectic Algebra - Robert Booth

Просмотров 1569 месяцев назад

Graphical Symplectic Algebra - Robert Booth

Flow-Preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation - Tommy McElvanney

46:30

Flow-Preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation - Tommy McElvanney

Просмотров 1209 месяцев назад

Flow-Preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation - Tommy McElvanney

Multi-Agent Blind Quantum Computation without Universal Cluster States - Shuxiang Cao

36:03

Multi-Agent Blind Quantum Computation without Universal Cluster States - Shuxiang Cao

Просмотров 1109 месяцев назад

Multi-Agent Blind Quantum Computation without Universal Cluster States - Shuxiang Cao