Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Towards compositional interpretability for xai
Artificial intelligence (AI) is currently based largely on black-box machine learning models
which lack interpretability. The field of eXplainable AI (XAI) strives to address this major …
which lack interpretability. The field of eXplainable AI (XAI) strives to address this major …
Advances in machine learning optimization for classical and quantum photonics
M Sanchez, C Everly, PA Postigo - JOSA B, 2024 - opg.optica.org
The development and optimization of photonic devices and various other nanostructure
electromagnetic devices present a computationally intensive task. Much optimization relies …
electromagnetic devices present a computationally intensive task. Much optimization relies …
The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
We present a smorgasbord of results on the stabiliser ZX-calculus for odd prime-
dimensional qudits (ie qupits). We derive a simplified rule set that closely resembles the …
dimensional qudits (ie qupits). We derive a simplified rule set that closely resembles the …
Light-matter interaction in the ZXW calculus
In this paper, we develop a graphical calculus to rewrite photonic circuits involving light-
matter interactions and non-linear optical effects. We introduce the infinite ZW calculus, a …
matter interactions and non-linear optical effects. We introduce the infinite ZW calculus, a …
An introduction to string diagrams for computer scientists
This document is an elementary introduction to string diagrams. It takes a computer science
perspective: rather than using category theory as a starting point, we build on intuitions from …
perspective: rather than using category theory as a starting point, we build on intuitions from …
Quantum picturalism: learning quantum theory in high school
Quantum theory is often regarded as challenging to learn and teach, with advanced
mathematical prerequisites ranging from complex numbers and probability theory to matrix …
mathematical prerequisites ranging from complex numbers and probability theory to matrix …
Automated reasoning in quantum circuit compilation
Automated reasoning techniques have been proven of immense importance in classical
applications like formal verification, circuit design and probabilistic inference. The domain of …
applications like formal verification, circuit design and probabilistic inference. The domain of …
Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions
Recent advances in classical simulation of Clifford+ T circuits make use of the ZX calculus to
iteratively decompose and simplify magic states into stabiliser terms. We improve on this …
iteratively decompose and simplify magic states into stabiliser terms. We improve on this …
Automating Equational Proofs in Dirac Notation
Dirac notation is widely used in quantum physics and quantum programming languages to
define, compute and reason about quantum states. This paper considers Dirac notation from …
define, compute and reason about quantum states. This paper considers Dirac notation from …
Mixed-dimensional quantum circuit simulation with decision diagrams
Quantum computers promise to solve several categories of problems faster than classical
computers ever could. Current research mostly focuses on qubits, ie, systems where the unit …
computers ever could. Current research mostly focuses on qubits, ie, systems where the unit …