Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Michael Zurel"'
Publikováno v:
PRX Quantum, Vol 5, Iss 3, p 030343 (2024)
A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling algorithms
Externí odkaz:
https://doaj.org/article/33bda3ba63ee48f39f9e37633bffb520
Publikováno v:
Quantum, Vol 8, p 1323 (2024)
It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum computation wit
Externí odkaz:
https://doaj.org/article/dc3672f952a74b519a6b11593fbfd548
Publikováno v:
Quantum, Vol 7, p 979 (2023)
A web of cohomological facts relates quantum error correction, measurement-based quantum computation, symmetry protected topological order and contextuality. Here we extend this web to quantum computation with magic states. In this computational sche
Externí odkaz:
https://doaj.org/article/680710efbbed4f25b1b319ad5ffc898e
Publikováno v:
Physical Review A. 105
Publikováno v:
Quantum Information and Computation. 22:627-628
We will fix an error in the proof of Theorem 2 of the work On the extremal points of the $\Lambda $-polytopes and classical simulation of quantum computation with magic states by the current authors, published in Quantum Information and Computation V
A web of cohomological facts relates quantum error correction, measurement-based quantum computation, symmetry protected topological order and contextuality. Here we extend this web to quantum computation with magic states. In this computational sche
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::55588869f0839f6c9b9409f63741a56f
Publikováno v:
Quantum Information and Computation
We investigate the $\Lambda$-polytopes, a convex-linear structure recently defined and applied to the classical simulation of quantum computation with magic states by sampling. There is one such polytope, $\Lambda_n$, for every number $n$ of qubits.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c90f4950556522f5cb7fbe940aa18c40
We show that every quantum computation can be described by Bayesian update of a probability distribution on a finite state space. When applied to the model of quantum computation with magic states, the size of this state space only depends on the num
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ceacd923d4e56f8603eba456885f69ba
http://arxiv.org/abs/2004.01992
http://arxiv.org/abs/2004.01992