arXiv subjects

Christopher Kane

Publications and source records attributed to Christopher Kane.

5 recordsLinked to original sources

arXiv2022

Efficient quantum implementation of 2+1 U(1) lattice gauge theories with Gauss law constraints

The study of real-time evolution of lattice quantum field theories using classical computers is known to scale exponentially with the number of lattice sites. Due to a fundamentally different computational strategy, quantum computers hold the promise of allowing for detailed studies of these dynamics from first principles. However, much like with classical computations, it is important that quantum algorithms do not have a cost that scales exponentially with the volume. Recently, it was shown how to break the exponential scaling of a naive implementation of a U(1) gauge theory in two spatial dimensions through an operator redefinition. In this work, we describe modifications to how operators must be sampled in the new operator basis to keep digitization errors small. We compare the precision of the energies and plaquette expectation value between the two operator bases and find they are comparable. Additionally, we provide an explicit circuit construction for the Suzuki-Trotter implementation of the theory using the Walsh function formalism. The gate count scaling is studied as a function of the lattice volume, for both exact circuits and approximate circuits where rotation gates with small arguments have been dropped. We study the errors from finite Suzuki-Trotter time-step, circuit approximation, and quantum noise in a calculation of an explicit observable using IBMQ superconducting qubit hardware. We find the gate count scaling for the approximate circuits can be further reduced by up to a power of the volume without introducing larger errors.

quant-ph↗

arXiv2022

Overcoming exponential scaling with system size in Trotter-Suzuki implementations of constrained Hamiltonians: 2+1 U(1) lattice gauge theories

For many quantum systems of interest, the classical computational cost of simulating their time evolution scales exponentially in the system size. At the same time, quantum computers have been shown to allow for simulations of some of these systems using resources that scale polynomially with the system size. Given the potential for using quantum computers for simulations that are not feasible using classical devices, it is paramount that one studies the scaling of quantum algorithms carefully. This work identifies a term in the Hamiltonian of a class of constrained systems that naively requires quantum resources that scale exponentially in the system size. An important example is a compact U(1) gauge theory on lattices with periodic boundary conditions. Imposing the magnetic Gauss' law a priori introduces a constraint into that Hamiltonian that naively results in an exponentially deep circuit. A method is then developed that reduces this scaling to polynomial in the system size, using a redefinition of the operator basis. An explicit construction of the matrices defining the change of operator basis, as well as the scaling of the associated computational cost, is given.

quant-ph↗

arXiv2021

Controlling unwanted exponentials in lattice calculations of radiative leptonic decays

Two important sources of systematic errors in lattice QCD calculations of radiative leptonic decays are unwanted exponentials in the sum over intermediate states and unwanted excited states created by the meson interpolating field. Performing the calculation using a 3d sequential propagator allows for better control over the systematic uncertainties from intermediate states, while using a 4d sequential propagator allows for better control over the systematic uncertainties from excited states. We calculate form factors using both methods and compare how reliably each controls these systematic errors. We also employ a hybrid approach involving global fits to data from both methods.

hep-lat↗

arXiv2019

Radiative leptonic decays on the lattice

Adding a hard photon to the final state of a leptonic pseudoscalar-meson decay lifts the helicity suppression and can provide sensitivity to a larger set of operators in the weak effective Hamiltonian. Furthermore, radiative leptonic $B$ decays at high photon energy are well suited to constrain the first inverse moment of the $B$-meson light-cone distribution amplitude, an important parameter in the theory of nonleptonic $B$ decays. We demonstrate that the calculation of radiative leptonic decays is possible using Euclidean lattice QCD, and present preliminary numerical results for $D_s^+ \to \ell^+ \nu\gamma$ and $K^- \to \ell^-\bar{\nu}\gamma$.

hep-lat↗

arXiv2018

High-level Cryptographic Abstractions

The interfaces exposed by commonly used cryptographic libraries are clumsy, complicated, and assume an understanding of cryptographic algorithms. The challenge is to design high-level abstractions that require minimum knowledge and effort to use while also allowing maximum control when needed. This paper proposes such high-level abstractions consisting of simple cryptographic primitives and full declarative configuration. These abstractions can be implemented on top of any cryptographic library in any language. We have implemented these abstractions in Python, and used them to write a wide variety of well-known security protocols, including Signal, Kerberos, and TLS. We show that programs using our abstractions are much smaller and easier to write than using low-level libraries, where size of security protocols implemented is reduced by about a third on average. We show our implementation incurs a small overhead, less than 5 microseconds for shared key operations and less than 341 microseconds (< 1%) for public key operations. We also show our abstractions are safe against main types of cryptographic misuse reported in the literature.

cs.CR↗