Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Arne Heimendahl"'
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 5, p 400 (2021)
The Gottesman-Knill theorem states that a Clifford circuit acting on stabilizer states can be simulated efficiently on a classical computer. Recently, this result has been generalized to cover inputs that are close to a coherent superposition of loga
Externí odkaz:
https://doaj.org/article/5dfa32d105a2445db7a3cbb34d23c865
Stabiliser operations occupy a prominent role in fault-tolerant quantum computing. They are defined operationally: by the use of Clifford gates, Pauli measurements and classical control. These operations can be efficiently simulated on a classical co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bacc1bf6161f1bc8d1b3ef5427cba755
http://arxiv.org/abs/2011.11651
http://arxiv.org/abs/2011.11651
Publikováno v:
Quantum, Vol 5, p 400 (2021)
The Gottesman-Knill theorem states that a Clifford circuit acting on stabilizer states can be simulated efficiently on a classical computer. Recently, this result has been generalized to cover inputs that are close to a coherent superposition of loga
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9022e278cd16442f0bd9c86af49ca5e
http://arxiv.org/abs/2007.04363
http://arxiv.org/abs/2007.04363