SearcharxivSearch

arXiv subjects

Kevin Obenland

Publications and source records attributed to Kevin Obenland.

7 recordsLinked to original sources

Harmonic sequence state-preparation

We demonstrate an efficient circuit to prepare a quantum state with amplitudes proportional to a harmonic sequence. We do this by first preparing a large quantum state with linearly related amplitudes and then applying a quantum Fourier transform; this has a direct analogy to the fact that the Fourier coefficients of a sawtooth wave follow a harmonic sequence. We then consider an extension of this problem by block-encoding a matrix with a harmonic sequence along its diagonal. The cost of both circuits is dominated by the costs associated with the quantum Fourier transform.

quant-ph

Efficient block-encodings require structure

Block-encodings are ubiquitous in quantum computing as a way to represent data within a unitary operator. While several unstructured methods are applicable to arbitrary data, these techniques are burdened by hidden costs and poor accuracy. In this paper, we demonstrate that, even for a small 6-qubit encoding, these structure-agnostic techniques require wildly intractable resources. We compare these resources with an encoding method which respects a mathematical representation of the block, leading to the conclusion that unstructured encoding mehtods should only be used in the most extenuating circumstances. This finding runs contrary to existing literature on quantum algorithms which often employ structure-agnostic methods.

quant-ph

A simpler Gaussian state-preparation

The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it faces enormous resource overheads making it functionally impractical. In this paper, we present a new, more intuitive method which uses exactly $n-1$ rotations, $(n-1)(n-2)/2$ two-qubit controlled rotations, and $\lfloor(n-1)/2\rfloor$ ancilla to state-prepare an $n$-qubit Gaussian state. We then apply optimizations to the circuit to render it linear in T-depth. This method can be extended to state-preparations of complex functions with polynomial phase.

quant-ph

Quantum Resources for Pure Thermal Shadows

Calculating the properties of Gibbs states is an important task in Quantum Chemistry and Quantum Machine Learning. Previous work has proposed a quantum algorithm which predicts Gibbs state expectation values for $M$ observables from only $\log{M}$ measurements, by combining classical shadows and quantum signal processing for a new estimator called Pure Thermal Shadows. In this work, we perform resource analysis for the circuits used in this algorithm, finding that quantum signal processing contributes most significantly to gate count and depth as system size increases. The implementation we use for this also features an improvement to the algorithm in the form of more efficient random unitary generation steps. Moreover, given the ramifications of the resource analysis, we argue that its potential utility could be constrained to Fault Tolerant devices sampling from the Gibbs state of a large, cool system.

quant-ph

Comparison of Superconducting NISQ Architectures

Advances in quantum hardware have begun the noisy intermediate-scale quantum (NISQ) computing era. A pressing question is: what architectures are best suited to take advantage of this new regime of quantum machines? We study various superconducting architectures including Google's Sycamore, IBM's Heavy-Hex, Rigetti's Aspen, and Ankaa in addition to a proposed architecture we call bus next-nearest neighbor (busNNN). We evaluate these architectures using benchmarks based on the quantum approximate optimization algorithm (QAOA) which can solve certain quadratic unconstrained binary optimization (QUBO) problems. We also study compilation tools that target these architectures, which use either general heuristic or deterministic methods to map circuits onto a target topology defined by an architecture.

quant-ph

Programming a quantum computer with quantum instructions

The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables fundamentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.

quant-ph

Empirical determination of the simulation capacity of a near-term quantum computer

Experimentally realizable quantum computers are rapidly approaching the threshold of quantum supremacy. Quantum Hamiltonian simulation promises to be one of the first practical applications for which such a device could demonstrate an advantage over all classical systems. However, these early devices will inevitably remain both noisy and small, precluding the use of quantum error correction. We use high-performance classical tools to construct, optimize, and simulate quantum circuits subject to realistic error models in order to empirically determine the "simulation capacity" of near-term simulation experiments implemented via quantum signal processing (QSP), describing the relationship between simulation time, system size, and resolution of QSP circuits which are optimally configured to balance algorithmic precision and external noise. From simulation capacity models, we estimate maximum tolerable error rate for meaningful simulation experiments on a near-term quantum computer. By exploiting symmetry inherent to the QSP circuit, we further demonstrate that its capacity for quantum simulation can be increased by at least two orders of magnitude if errors are systematic and unitary. We find that a device with $ε^2=10^{-5}$ systematic amplitude errors could meaningfully simulate systems up to $n\approx16$ with an expected failure rate below $10\%$, whereas the largest system a device with a stochastic error rate of $p_ε=10^{-5}$ could meaningfully simulate with the same rate of failure is between $n=3$ and $n=5$ (depending on the stochastic channel). Extrapolating from empirical results, we estimate that one would typically need a stochastic error rate below $p_ε=10^{-8}$ to perform a meaningful $n=50$ simulation experiment with a failure rate below $10\%$, while the same experiment could tolerate systematic unitary errors with strength $ε^2\approx10^{-6}$.

quant-ph