Zobrazeno 1 - 10
of 26
pro vyhledávání: '"John van de Wetering"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 287, Iss Proc. QPL 2018, Pp 345-364 (2019)
We propose a definition of purity for positive linear maps between Euclidean Jordan Algebras (EJA) that generalizes the notion of purity for quantum systems. We show that this definition of purity is closed under composition and taking adjoints and t
Externí odkaz:
https://doaj.org/article/9e0e1fc44cd4444b99d1ace9de1ace63
Publikováno v:
PRX Quantum, Vol 3, Iss 1, p 010302 (2022)
From Feynman diagrams to tensor networks, diagrammatic representations of computations in quantum mechanics have catalyzed progress in physics. These diagrams represent the underlying mathematical operations and aid physical interpretation, but canno
Externí odkaz:
https://doaj.org/article/5c595421fdac462caf7ca3fae59a33fd
Autor:
John van de Wetering
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 266, Iss Proc. QPL 2017, Pp 179-196 (2018)
There is a long history of representing a quantum state using a quasi-probability distribution: a distribution allowing negative values. In this paper we extend such representations to deal with quantum channels. The result is a convex, strongly mono
Externí odkaz:
https://doaj.org/article/f648256f15fb42d3b0188299e82ac5b3
Publikováno v:
Quantum, Vol 5, p 421 (2021)
Translations between the quantum circuit model and the measurement-based one-way model are useful for verification and optimisation of quantum computations. They make crucial use of a property known as gflow. While gflow is defined for one-way comput
Externí odkaz:
https://doaj.org/article/74035ffbcdf64fc58f3742fc227a44d2
Autor:
John van de Wetering
Publikováno v:
New Journal of Physics, Vol 23, Iss 4, p 043015 (2021)
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 single-qubit gates and two-qubit CNOT gates. A CNOT gate is however not alway
Externí odkaz:
https://doaj.org/article/72e843d7af8241ada9933fedf198d9e8
Publikováno v:
Quantum, Vol 4, p 378 (2020)
A sequential effect algebra (SEA) is an effect algebra equipped with a $\textit{sequential product}$ operation modeled after the Lüders product $(a,b)\mapsto \sqrt{a}b\sqrt{a}$ on C$^*$-algebras. A SEA is called $\textit{normal}$ when it has all sup
Externí odkaz:
https://doaj.org/article/132ce25e0b1941eca8cb59d8561541df
Autor:
John van de Wetering
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 221, Iss Proc. SLPCS 2016, Pp 58-66 (2016)
In this paper we give an overview of partial orders on the space of probability distributions that carry a notion of information content and serve as a generalisation of the Bayesian order given in (Coecke and Martin, 2011). We investigate what const
Externí odkaz:
https://doaj.org/article/583d52b6437849dc979470188542c550
Publikováno v:
Quantum, Vol 4, p 279 (2020)
We present a completely new approach to quantum circuit optimisation, based on the ZX-calculus. We first interpret quantum circuits as ZX-diagrams, which provide a flexible, lower-level language for describing quantum computations graphically. Then,
Externí odkaz:
https://doaj.org/article/1ce5e62213264d06b90d16e5f9f917f2
Autor:
Aleks Kissinger, John van de Wetering
Publikováno v:
Quantum, Vol 3, p 134 (2019)
We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form $\exp(-i\frac{\pi}{2
Externí odkaz:
https://doaj.org/article/ada86471887c4d1d886dbea74e3cb295
Autor:
John Van de Wetering, Aleks Kissinger
Publikováno v:
Quantum Science and Technology, 7, 1-17
Quantum Science and Technology, 7, 4, pp. 1-17
Quantum Science and Technology, 7, 4, pp. 1-17
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum circuits can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::73ebad8247f313acd6faad7a6f6f1645
https://hdl.handle.net/2066/253568
https://hdl.handle.net/2066/253568