Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Michael J. Bremner"'
Autor:
Jason Gavriel, Daniel Herr, Alexis Shaw, Michael J. Bremner, Alexandru Paler, Simon J. Devitt
Publikováno v:
Physical Review Research, Vol 5, Iss 3, p 033019 (2023)
Fault-tolerant, error-corrected quantum computation is commonly acknowledged to be crucial to the realization of large-scale quantum algorithms that could lead to extremely impactful scientific or commercial results. Achieving a universal set of quan
Externí odkaz:
https://doaj.org/article/f6399b2c89b04c3d9613f1bb46938282
Publikováno v:
npj Quantum Information, Vol 3, Iss 1, Pp 1-8 (2017)
Abstract There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics. But the question of the exact nature of the pow
Externí odkaz:
https://doaj.org/article/626c8c545e0c4c84a3aad0be80c3b336
Autor:
Ryan L. Mann, Michael J. Bremner
Publikováno v:
Quantum, Vol 3, p 162 (2019)
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions and external
Externí odkaz:
https://doaj.org/article/4f080fd3c9214d1a8fac85d177db907a
Publikováno v:
Quantum, Vol 1, p 8 (2017)
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in the presence
Externí odkaz:
https://doaj.org/article/e3dfd5dc850e4f96a48bb847bedbc957
Autor:
Ryan Babbush, Hartmut Neven, Zhang Jiang, Sergio Boixo, Nan Ding, Sergei V. Isakov, Michael J. Bremner, John M. Martinis, Vadim Smelyanskiy
Publikováno v:
Nature Physics. 14:595-600
A critical question for the field of quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of state-of-the-art classical computers, achieving so-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81913fa8753d0156e36b66de2f182e74
https://doi.org/10.1038/s41567-018-0124-x
https://doi.org/10.1038/s41567-018-0124-x
Autor:
Michael J. Bremner
When can one quantum system be used to simulate another? What aspects of a quantum system restrict its capacity to simulate other systems? Understanding the limitations and possibilities of such simulations is a key issue at the intersection of physi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5541005118188b2fbe9f44ac05d64a3e
https://doi.org/10.14264/uql.2019.478
https://doi.org/10.14264/uql.2019.478
Autor:
Michael J. Bremner, Ryan L. Mann
Publikováno v:
Mann, R L & Bremner, M J 2018, ' Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs ', Quantum, vol. 3 . https://doi.org/10.22331/q-2019-07-11-162
Quantum, Vol 3, p 162 (2019)
Quantum, Vol 3, p 162 (2019)
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions and external
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::29e3af15c5bbabf60ea8edd4f1ba5d55
Publikováno v:
npj Quantum Information, Vol 3, Iss 1, Pp 1-8 (2017)
There is a large body of evidence for the potential of greater computational power using information carriers that are quantum mechanical over those governed by the laws of classical mechanics. But the question of the exact nature of the power contri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c8eb55687a6da1546e62c73f043f90e
https://hdl.handle.net/10453/100654
https://hdl.handle.net/10453/100654
Autor:
Daniel J. Shepherd, Michael J. Bremner
Publikováno v:
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 465:1413-1439
We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here temporally unstructured (‘ instantaneous ’) quantum computation because it allows for essentially no temporal structure within the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::832888ad0d8415594b215982d1a850ec
https://doi.org/10.1098/rspa.2008.0443
https://doi.org/10.1098/rspa.2008.0443
Publikováno v:
Bremner, M, Montanaro, A & Shepherd, D 2016, ' Average-case complexity versus approximate simulation of commuting quantum computations ', Physical Review Letters, vol. 117, 080501 . https://doi.org/10.1103/PhysRevLett.117.080501
We use the class of commuting quantum computations known as IQP (Instantaneous Quantum Polynomial time) to strengthen the conjecture that quantum computers are hard to simulate classically. We show that, if either of two plausible average-case hardne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7b03289cce7252715d3e950dfdb681e
http://arxiv.org/abs/1504.07999
http://arxiv.org/abs/1504.07999