scientific article; zbMATH DE number 6313121

zbMath1371.68091arXiv1203.1331MaRDI QIDQ5168281

Alán Aspuru-Guzik, James D. Whitfield, Sergio Boixo, Man-Hong Yung, David G. Tempel

Publication date: 3 July 2014

Full work available at URL: https://arxiv.org/abs/1203.1331

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (6)

Faster ground state preparation and high-precision ground energy estimation with fewer qubits ⋮ Why the quantitative condition fails to reveal quantum adiabaticity ⋮ Computational complexity of time-dependent density functional theory ⋮ A quantum algorithm for obtaining the lowest eigenstate of a Hamiltonian assisted with an ancillary qubit system ⋮ A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles ⋮ Simple digital quantum algorithm for symmetric first-order linear hyperbolic systems

This page was built for publication: