Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Alexander M. Dalzell"'
Autor:
Seunghoon Lee, Joonho Lee, Huanchen Zhai, Yu Tong, Alexander M. Dalzell, Ashutosh Kumar, Phillip Helms, Johnnie Gray, Zhi-Hao Cui, Wenyuan Liu, Michael Kastoryano, Ryan Babbush, John Preskill, David R. Reichman, Earl T. Campbell, Edward F. Valeev, Lin Lin, Garnet Kin-Lic Chan
Publikováno v:
Nature Communications, Vol 14, Iss 1, Pp 1-7 (2023)
The extent of problems in quantum chemistry for which quantum algorithms could provide a speedup is still unclear, as well as the kind of speedup one should expect. Here, the authors look at the problem of ground state energy estimation, and gather t
Externí odkaz:
https://doaj.org/article/bf9e0274d52c4891bee800a0d650eeba
Publikováno v:
Quantum, Vol 8, p 1257 (2024)
We propose a novel deterministic method for preparing arbitrary quantum states. When our protocol is compiled into CNOT and arbitrary single-qubit gates, it prepares an $N$-dimensional state in depth $O(\log(N))$ and $\textit{spacetime allocation}$ (
Externí odkaz:
https://doaj.org/article/f197fa6f90d44b538dd19c1e294d4e70
Publikováno v:
Physical Review X, Vol 14, Iss 1, p 011014 (2024)
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that has a non-n
Externí odkaz:
https://doaj.org/article/ae50799eb8cc4e1389e8076186e4ad18
Autor:
Alexander M. Dalzell, B. David Clader, Grant Salton, Mario Berta, Cedric Yen-Yu Lin, David A. Bader, Nikitas Stamatopoulos, Martin J. A. Schuetz, Fernando G. S. L. Brandão, Helmut G. Katzgraber, William J. Zeng
Publikováno v:
PRX Quantum, Vol 4, Iss 4, p 040325 (2023)
We study quantum interior-point methods (QIPMs) for second-order cone programming (SOCP), guided by the example use case of portfolio optimization (PO). We provide a complete quantum circuit-level description of the algorithm from problem input to pr
Externí odkaz:
https://doaj.org/article/4829c40142644d01bdd4f645f19bacde
Autor:
B. David Clader, Alexander M. Dalzell, Nikitas Stamatopoulos, Grant Salton, Mario Berta, William J. Zeng
Publikováno v:
IEEE Transactions on Quantum Engineering, Vol 3, Pp 1-23 (2022)
We provide a modular circuit-level implementation and resource estimates for several methods of block-encoding a dense $N\times N$ matrix of classical data to precision $\epsilon$; the minimal-depth method achieves a $T$-depth of $\mathcal {O}(\log (
Externí odkaz:
https://doaj.org/article/534fa8dd8a9e4c9394de376908b74b2b
Autor:
John C. Napp, Rolando L. La Placa, Alexander M. Dalzell, Fernando G. S. L. Brandão, Aram W. Harrow
Publikováno v:
Physical Review X, Vol 12, Iss 2, p 021021 (2022)
A central question of quantum computing is determining the source of the advantage of quantum computation over classical computation. Even though simulating quantum dynamics on a classical computer is thought to require exponential overhead in the wo
Externí odkaz:
https://doaj.org/article/782dde1aec4546499deacbef03ff8d44
Publikováno v:
PRX Quantum, Vol 3, Iss 1, p 010333 (2022)
We consider quantum circuits consisting of randomly chosen two-local gates and study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anticoncentrated, roughly meaning that the probability
Externí odkaz:
https://doaj.org/article/4c57d7a11f79430d91c8ed6fbef65db4
Publikováno v:
Quantum, Vol 4, p 264 (2020)
Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of classical
Externí odkaz:
https://doaj.org/article/81b252906c7643979d6ebf3fc8fd0060
Publikováno v:
Quantum, Vol 3, p 187 (2019)
A key feature of ground states of gapped local 1D Hamiltonians is their relatively low entanglement --- they are well approximated by matrix product states (MPS) with bond dimension scaling polynomially in the length $N$ of the chain, while general s
Externí odkaz:
https://doaj.org/article/7bf3afdb9896495ab8efa2e876f4cc6d
We consider quantum circuits consisting of randomly chosen two-local gates and study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated, roughly meaning that the probability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4b4d118bd33a6bfb8915a516d573b062
http://arxiv.org/abs/2011.12277
http://arxiv.org/abs/2011.12277
