Zobrazeno 1 - 10
of 79
pro vyhledávání: '"Richard Jozsa"'
Autor:
Adriano Barenco, Charles H Bennett, Isaac L Chuang, Richard Jozsa, Hoi-kwong Lo, Sandu Popescu, John Preskill, Daniel Rohrlich, Timothy P Spiller, Andrew M Steane, Hugo Zbinden
This book aims to provide a pedagogical introduction to the subjects of quantum information and quantum computation. Topics include non-locality of quantum mechanics, quantum computation, quantum cryptography, quantum error correction, fault-tolerant
Publikováno v:
Physical Review A. 102
We study the classical simulation complexity, in both the weak and strong senses, of matchgate (MG) computations supplemented with all combinations of settings involving inclusion of intermediate adaptive or nonadaptive computational basis measuremen
Magic states were introduced in the context of Clifford circuits as a resource that elevates classically simulatable computations to quantum universal capability, while maintaining the same gate set. Here we study magic states in the context of match
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71f58ffda4cced38423d5be25e0c294b
http://arxiv.org/abs/1905.08584
http://arxiv.org/abs/1905.08584
Publikováno v:
Proc Math Phys Eng Sci
We study the computational power of unitary Clifford circuits with solely magic state inputs (CM circuits), supplemented by classical efficient computation. We show that CM circuits are hard to classically simulate up to multiplicative error (assumin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6acccb1efbc7324c0d410bb63357086b
http://arxiv.org/abs/1806.03200
http://arxiv.org/abs/1806.03200
We review existing methods for implementing smooth functions f(A) of a sparse Hermitian matrix A on a quantum computer, and analyse a further combination of these techniques which has some advantages of simplicity and resource consumption in some cas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5a2ebeb462f603d2aec400c11389c256
Autor:
Richard Jozsa, Marrten Van den Nest
Publikováno v:
Quantum Information and Computation. 14:633-648
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true only in a su
We define and study a new type of quantum oracle, the quantum conditional oracle, which provides oracle access to the conditional probabilities associated with an underlying distribution. Amongst other properties, we (a) obtain highly efficient quant
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1f7a54cfa552378a40c713a697c9a079
http://arxiv.org/abs/1609.01600
http://arxiv.org/abs/1609.01600
Autor:
Richard Jozsa, Artur Ekert
Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::10751d7f64a27fd89ac3efef837c5f2a
https://doi.org/10.1103/revmodphys.68.733
https://doi.org/10.1103/revmodphys.68.733
Autor:
Richard Jozsa, Akimasa Miyake
Publikováno v:
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 464:3089-3106
Let G(A,B) denote the 2-qubit gate which acts as the 1-qubit SU(2) gates A and B in the even and odd parity subspaces respectively, of two qubits. Using a Clifford algebra formalism we show that arbitrary uniform families of circuits of these gates,
Publikováno v:
Quantum Information and Computation. 8:106-126
Quantum computations starting with computational basis states and involving only Clifford operations, are classically simulable despite the fact that they generate highly entangled states; this is the content of the Gottesman-Knill theorem. Here we i