SearcharxivSearch

arXiv subjects

William M. Kaminsky

Publications and source records attributed to William M. Kaminsky.

3 recordsLinked to original sources

Hamiltonian singular value transformation and inverse block encoding

The quantum singular value transformation is a powerful quantum algorithm that allows one to apply a polynomial transformation to the singular values of a matrix that is embedded as a block of a unitary transformation. This paper shows how to perform the quantum singular value transformation for a matrix that can be embedded as a block of a Hamiltonian. The transformation can be implemented in a purely Hamiltonian context by the alternating application of Hamiltonians for chosen intervals: it is an example of the Quantum Alternating Operator Ansatz (generalized QAOA). We also show how to use the Hamiltonian quantum singular value transformation to perform inverse block encoding to implement a unitary of which a given Hamiltonian is a block. Inverse block encoding leads to novel procedures for matrix multiplication and for solving differential equations on quantum information processors in a purely Hamiltonian fashion.

quant-ph

Scalable Superconducting Architecture for Adiabatic Quantum Computation

A scalable superconducting architecture for adiabatic quantum computers is proposed. The architecture is based on time-independent, nearest-neighbor interqubit couplings: it can handle any problem in the class NP even in the presence of measurement errors, noise, and decoherence. The implementation of this architecture with superconducting persistent-current qubits and the natural robustness of such an implementation to manufacturing imprecision and decoherence are discussed.

quant-ph

Scalable Architecture for Adiabatic Quantum Computing of NP-Hard Problems

We present a comprehensive review of past research into adiabatic quantum computation and then propose a scalable architecture for an adiabatic quantum computer that can treat NP-hard problems without requiring local coherent operations. Instead, computation can be performed entirely by adiabatically varying a magnetic field applied to all the qubits simultaneously. Local (incoherent) operations are needed only for: (1) switching on or off certain pairwise, nearest-neighbor inductive couplings in order to set the problem to be solved and (2) measuring some subset of the qubits in order to obtain the answer to the problem.

quant-ph