Zobrazeno 1 - 10
of 2 344
pro vyhledávání: '"P, Kissinger"'
Stabiliser codes with large weight measurements can be challenging to implement fault-tolerantly. To overcome this, we propose a Floquetification procedure which, given a stabiliser code, synthesises a novel Floquet code that only uses single- and tw
Externí odkaz:
http://arxiv.org/abs/2410.17240
Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of string diagrams: a key step towards integrating these hybrid algorithm
Externí odkaz:
http://arxiv.org/abs/2407.03673
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 dis
Externí odkaz:
http://arxiv.org/abs/2404.09915
Publikováno v:
EPTCS 406, 2024, pp. 79-95
This is the second in a series of "graphical grokking" papers in which we study how stabiliser codes can be understood using the ZX-calculus. In this paper we show that certain complex rules involving ZX-diagrams, called spider nest identities, can b
Externí odkaz:
http://arxiv.org/abs/2404.07828
Autor:
Sutcliffe, Matthew, Kissinger, Aleks
Publikováno v:
EPTCS 406, 2024, pp. 63-78
A quantum circuit may be strongly classically simulated with the aid of ZX-calculus by decomposing its $t$ T-gates into a sum of $2^{\alpha t}$ classically computable stabiliser terms. In this paper, we introduce a general procedure to find an optima
Externí odkaz:
http://arxiv.org/abs/2403.10964
Autor:
Simmons, Will, Kissinger, Aleks
The $\mathrm{Caus}[-]$ construction takes a base category of ``raw materials'' and builds a category of higher order causal processes, that is a category whose types encode causal (a.k.a. signalling) constraints between collections of systems. Notabl
Externí odkaz:
http://arxiv.org/abs/2403.09297
Autor:
Sutcliffe, Matthew, Kissinger, Aleks
The ZX-calculus is an algebraic formalism that allows quantum computations to be simplified via a small number of simple graphical rewrite rules. Recently, it was shown that, when combined with a family of "sum-over-Cliffords" techniques, the ZX-calc
Externí odkaz:
http://arxiv.org/abs/2403.06777
Parametrised quantum circuits contain phase gates whose phase is determined by a classical algorithm prior to running the circuit on a quantum device. Such circuits are used in variational algorithms like QAOA and VQE. In order for these algorithms t
Externí odkaz:
http://arxiv.org/abs/2401.12877
Autor:
Dündar-Coecke, Selma, Yeh, Lia, Puca, Caterina, Pfaendler, Sieglinde M. -L., Waseem, Muhammad Hamza, Cervoni, Thomas, Kissinger, Aleks, Gogioso, Stefano, Coecke, Bob
Publikováno v:
2023 IEEE International Conference on Quantum Computing and Engineering (QCE), 2023, pp. 21-32
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 Hilbe
Externí odkaz:
http://arxiv.org/abs/2312.03653
Autor:
Friend, Isaac, Kissinger, Aleks
Publikováno v:
EPTCS 394, 2023, pp. 101-115
Though the topic of causal inference is typically considered in the context of classical statistical models, recent years have seen great interest in extending causal inference techniques to quantum and generalized theories. Causal identification is
Externí odkaz:
http://arxiv.org/abs/2311.08882