Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
ZX-calculus for the working quantum computer scientist
J van de Wetering - arxiv preprint arxiv:2012.13966, 2020 - arxiv.org
The ZX-calculus is a graphical language for reasoning about quantum computation that has
recently seen an increased usage in a variety of areas such as quantum circuit optimisation …
recently seen an increased usage in a variety of areas such as quantum circuit optimisation …
Quantum circuit synthesis and compilation optimization: Overview and prospects
Quantum computing is regarded as a promising paradigm that may overcome the current
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …
There and back again: A circuit extraction tale
Translations between the quantum circuit model and the measurement-based one-way
model are useful for verification and optimisation of quantum computations. They make …
model are useful for verification and optimisation of quantum computations. They make …
Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
The ZX-calculus is a universal graphical language for qubit quantum computation, meaning
that every linear map between qubits can be expressed in the ZX-calculus. Furthermore, it is …
that every linear map between qubits can be expressed in the ZX-calculus. Furthermore, it is …
Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
We introduce an enhanced technique for strong classical simulation of quantum circuits
which combines the'sum-of-stabilisers' method with an automated simplification strategy …
which combines the'sum-of-stabilisers' method with an automated simplification strategy …
Fast and effective techniques for T-count reduction via spider nest identities
In fault-tolerant quantum computing systems, realising (approximately) universal quantum
computation is usually described in terms of realising Clifford+ T operations, which is to say …
computation is usually described in terms of realising Clifford+ T operations, which is to say …
Reconstructing quantum theory from diagrammatic postulates
A reconstruction of quantum theory refers to both a mathematical and a conceptual
paradigm that allows one to derive the usual formulation of quantum theory from a set of …
paradigm that allows one to derive the usual formulation of quantum theory from a set of …
Quantum circuit optimization with alphatensor
A key challenge in realizing fault-tolerant quantum computers is circuit optimization.
Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T …
Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T …
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 …
Constructing quantum circuits with global gates
J Van de Wetering - New Journal of Physics, 2021 - iopscience.iop.org
There are various gate sets that can be used to describe a quantum computation. A
particularly popular gate set in the literature on quantum computing consists of arbitrary …
particularly popular gate set in the literature on quantum computing consists of arbitrary …