SearcharxivSearch

arXiv subjects

Jacob S. Nelson

Publications and source records attributed to Jacob S. Nelson.

3 recordsLinked to original sources

Estimating Green's functions with a robust quantum Arnoldi method

Many applications of Green's functions (GFs) require their evaluation over intervals or at multiple points, motivating quantum algorithms that return an efficiently computable functional representation rather than mere point estimates. We introduce a robust quantum Arnoldi method (ROQAM) that achieves this goal. Its robustness is derived from formulation in terms of orthogonal polynomials, which preserves the upper-Hessenberg structure of the projected matrices despite finite-precision estimation. We also show that as the iteration depth increases, the precision required for matrix-element estimation can be reduced. Resource estimates for the spectral function of a quantum impurity model indicate that ROQAM outperforms pointwise estimation via quantum singular value transformation by multiple orders of magnitude. Finally, we show that the ROQAM can be used to estimate GFs at nonzero temperatures using only a single Krylov subspace.

quant-ph

A small and interesting architecture for early fault-tolerant quantum computers

We present an architecture for early fault-tolerant quantum computers based on the smallest interesting colour code (Earl Campbell, 2016). It realizes a universal logical gate set consisting of single-qubit measurements and preparations in the X and Z bases, single-qubit Hadamard (H) gates, and three-qubit controlled-controlled-Z (CCZ) gates. State teleportations between [[4, 2, 2]] (2D) and [[8, 3, 2]] (3D) error-detecting color codes allow one to make use of the respective transversal H and CCZ gates that these codes possess. As such, minimizing the number of logical quantum teleportation operations, not the number of logical quantum non-Clifford gates, is the relevant optimization goal. To help hardware developers characterize this architecture, we also provide an experimental protocol tailored to testing logical quantum circuits expressed in it.

quant-ph

An assessment of quantum phase estimation protocols for early fault-tolerant quantum computers

We compare several quantum phase estimation (QPE) protocols intended for early fault-tolerant quantum computers (EFTQCs) in the context of models of their implementations on a surface code architecture. We estimate the logical and physical resources required to use these protocols to calculate the ground state energy of molecular hydrogen in a minimal basis with error below $10^{-3}$ atomic units in the presence of depolarizing logical errors. Accounting for the overhead of rotation synthesis and magic state distillation, we find that the total $T$-gate counts do not vary significantly among the EFT QPE protocols at fixed state overlap. In addition to reducing the number of ancilla qubits and circuit depth, the noise robustness of the EFT protocols can be leveraged to reduce resource requirements below those of textbook QPE, realizing approximately a 300-fold reduction in computational volume in some cases. Even so, our estimates are well beyond the scale of existing early fault-tolerance demonstrations.

quant-ph