arXiv subjects

Barry C. Sanders

Publications and source records attributed to Barry C. Sanders.

At least 55 records · Page 3Linked to original sources

arXiv2022

Nearly optimal quantum algorithm for generating the ground state of a free quantum field theory

We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a super-quadratic speedup over the state-of-the-art quantum algorithm for ground-state generation, overcomes the ground-state-generation bottleneck of the prior approach and is optimal up to a polylogarithmic factor. Specifically, we establish two quantum algorithms -- Fourier-based and wavelet-based -- to generate the ground state of a free massive scalar bosonic QFT with gate complexity quasilinear in the number of discretized-QFT modes. The Fourier-based algorithm is limited to translationally invariant QFTs. Numerical simulations show that the wavelet-based algorithm successfully yields the ground state for a QFT with broken translational invariance. Furthermore, the cost of preparing particle excitations in the wavelet approach is independent of the energy scale. Our algorithms require a routine for generating one-dimensional Gaussian (1DG) states. We replace the standard method for 1DG-state generation, which requires the quantum computer to perform lots of costly arithmetic, with a novel method based on inequality testing that significantly reduces the need for arithmetic. Our method for 1DG-state generation is generic and could be extended to preparing states whose amplitudes can be computed on the fly by a quantum computer.

quant-ph↗

arXiv2022

Two-qubit gate in neutral atoms using transitionless quantum driving

A neutral-atom system serves as a promising platform for realizing gate-based quantum computing because of its capability to trap and control several atomic qubits in different geometries and the ability to perform strong, long-range interactions between qubits; however, the two-qubit entangling gate fidelity lags behind competing platforms such as superconducting systems and trapped ions. The aim of our work is to design a fast, robust, high-fidelity controlled-Z (CZ) gate, based on the Rydberg-blockade mechanism, for neutral atoms. We propose a gate procedure that relies on simultaneous and transitionless quantum driving of a pair of atoms using broadband lasers. By simulating a system of two interacting Caesium atoms, including spontaneous emission from excited levels and parameter fluctuations, we yield a Rydberg-blockade CZ gate with fidelity 0.9985 over an operation time of $0.12~μ$s. Our gate procedure delivers CZ gates that are superior than the state-of-the-art experimental CZ gate and the simulated CZ gates based on adiabatic driving of atoms. Our results show that our gate procedure carries significant potential for achieving scalable quantum computing using neutral atoms.

quant-ph↗

arXiv2022

Sparse interferometry for measuring multiphoton collective phase

A multiphoton collective phase is a multiphoton-scattering feature that cannot be reduced to a sequence of two-photon scattering events, and the three-photon "triad phas" is the smallest nontrivial example. Observing a higher-order collective phase is experimentally challenging, and only triad and four-photon tetrad collective phases have been observed. We introduce a scheme to make higher-order multiphoton collective-phase observations feasible by designing a sparse interferometer, which significantly reduces complexity compared with the current best scheme for observing a multiphoton collective phase. Specifically, our scheme reduces the optical depth from logarithmic to constant and reduces the number of beam splitters from $O(n\log n)$ to linear scaling with respect to the collective-phase order $n$. As constant depth reduces loss and dispersion to a fixed rate regardless of collective-phase order, a major obstacle to observing large-scale collective phases is removed.

quant-ph↗

arXiv2022

Nonlinear quantum gates for a Bose-Einstein condensate

Quantum interferometry and quantum information processing have been proposed for Bose-Einstein condensates (BECs), but BECs are described in complicated ways such as using quantum field theory or using a nonlinear differential equation. Nonlinear quantum mechanics does not mesh well with the superposition principle at the heart of interferometry and quantum information processing but could be compatible. Thus, we develop a rigorous foundation for quantum gates, obtained by solving the equation for evolution, and then we employ this foundation, combined with quantum-control techniques and appropriate state-sampling techniques, to devise feasible nonlinear Hadamard gates and thereby feasible, i.e., high-contrast, nonlinear Ramsey interferometry. Our approach to BEC interferometry and quantum logic shifts the paradigm by enlarging to the case of nonlinear quantum mechanics, which we apply to the cases of BEC interferometry and quantum information processing.

quant-ph↗

arXiv2022

Optimal tests for continuous-variable quantum teleportation and photodetectors

Quantum teleportation is a primitive in several important applications, including quantum communication, quantum computation, error correction, and quantum networks. In this work, we propose an optimal test for the performance of continuous-variable (CV) quantum teleportation in terms of the energy-constrained channel fidelity between ideal CV teleportation and its experimental implementation. Work prior to ours considered suboptimal tests of the performance of CV teleportation, focusing instead on its performance for particular states, such as ensembles of coherent states, squeezed states, cat states, etc. Here we prove that the optimal state for testing CV teleportation is an entangled superposition of twin Fock states. We establish this result by reducing the problem of estimating the energy-constrained channel fidelity between ideal CV teleportation and its experimental approximation to a quadratic program and solving it. As an additional result, we obtain an analytical solution to the energy-constrained diamond distance between a photodetector and its experimental approximation. These results are relevant for experiments that make use of CV teleportation and photodetectors.

quant-ph↗

arXiv2022

Generalized Interference of Fermions and Bosons

Using tools from representation theory, we derive expressions for the coincidence rate of partially-distinguishable particles in an interferometry experiment. Our expressions are valid for either bosons or fermions, and for any number of particles. In an experiment with $n$ particles the expressions we derive contain a term for each partition of the integer $n$; Gamas's theorem is used to determine which of these terms are automatically zero based on the pairwise level of distinguishability between particles. Most sampling schemes (such as Boson Sampling) are limited to completely indistinguishable particles; our work aids in the understanding of systems where an arbitrary level of distinguishability is permitted. As an application of our work we introduce a sampling scheme with partially-distinguishable fermions, which we call Generalized Fermion Sampling.

quant-ph↗

arXiv2021

Topological graph states and quantum error correction codes

Deciding if a given family of quantum states is topologically ordered is an important but nontrivial problem in condensed matter physics and quantum information theory. We derive necessary and sufficient conditions for a family of graph states to be in TQO-1, which is a class of quantum error correction code states whose code distance scales macroscopically with the number of physical qubits. Using these criteria, we consider a number of specific graph families, including the star and complete graphs, and the line graphs of complete and completely bipartite graphs, and discuss which are topologically ordered and how to construct the codewords. The formalism is then employed to construct several codes with macroscopic distance, including a three-dimensional topological code generated by local stabilizers that also has a macroscopic number of encoded logical qubits. The results indicate that graph states provide a fruitful approach to the construction and characterization of topological stabilizer quantum error correction codes.

quant-ph↗

arXiv2021

Security for Quantum Networks

Reliable and efficient functioning of a quantum network depends on identifying and mitigating security risks originating from within and outside the network. We aim to construct a comprehensive framework for developing and assessing secure quantum networks. We articulate issues for making quantum networks secure in general, summarise the state of the art and identify priority directions for further investigation. Our analysis builds on the secure communication protocols developed for classical layered network architectures such as the open-systems interconnection (OSI) model and the transmission control protocol/internet protocol (TCP/IP) model. Our work will lead to the development of a hardware-independent framework for securing general quantum networks that allows developers to identify mandatory security mechanisms and incorporate additional security requirements of the clients during design of the networks.

quant-ph↗

arXiv2021

Double-slit interferometry as a lossy beam splitter

We cast diffraction-based interferometry in the framework of post-selected unitary description towards enabling it as a platform for quantum information processing. We express slit-diffraction as an infinite-dimensional transformation and truncate it to a finite-dimensional transfer matrix by post-selecting modes. Using such a framework with classical fields, a customized double-slit setup is effectively a lossy beam splitter in a post-selected sense. Diffraction optics provides a robust alternative to conventional multi-beam interferometry with scope for miniaturization, and also has applications in matter wave interferometry. In this work, the classical treatment sets the stage for quantization of fields and implementing higher dimensional quantum information processing like that done with other platforms such as orbital angular momentum.

quant-ph↗

arXiv2021

Channel Discord and Distortion

Discord, originally notable as a signature of bipartite quantum correlation,in fact can be nonzero classically, i.e., arising from noisy measurements by one of the two parties. Here we redefine classical discord to quantify channel distortion,in contrast to the previous restriction of classical discord to a state,and we then show a monotonic relationship between classical (channel) discord and channel distortion. We show that classical discord is equivalent to (doubly stochastic) channel distortion by numerically discovering a monotonic relation between discord and total-variation distance for a bipartite protocol with one party having a noiseless channel and the other party having a noisy channel. Our numerical method includes randomly generating doubly stochastic matrices for noisy channels and averaging over a uniform measure of input messages. Connecting discord with distortion establishes discord as a signature of classical, not quantum, channel distortion.

quant-ph↗

arXiv2021

Quadratic Quantum Speedup for Perceptron Training

Perceptrons, which perform binary classification, are the fundamental building blocks of neural networks. Given a data set of size~$N$ and margin~$γ$ (how well the given data are separated), the query complexity of the best-known quantum training algorithm scales as either $(\nicefrac{\sqrt{N}}{γ^2})\log(\nicefrac1{γ^2)}$ or $\nicefrac{N}{\sqrtγ}$, which is achieved by a hybrid of classical and quantum search. In this paper, we improve the version space quantum training method for perceptrons such that the query complexity of our algorithm scales as $\sqrt{\nicefrac{N}γ}$. This is achieved by constructing an oracle for the perceptrons using quantum counting of the number of data elements that are correctly classified. We show that query complexity to construct such an oracle has a quadratic improvement over classical methods. Once such an oracle is constructed, bounded-error quantum search can be used to search over the hyperplane instances. The optimality of our algorithm is proven by reducing the evaluation of a two-level AND-OR tree (for which the query complexity lower bound is known) to a multi-criterion search. Our quantum training algorithm can be generalized to train more complex machine learning models such as neural networks, which are built on a large number of perceptrons.

quant-ph↗

arXiv2021

Broadband quantum memory in a cavity via zero spectral dispersion

We seek to design experimentally feasible broadband, temporally multiplexed optical quantum memory with near-term applications to telecom bands. Specifically, we devise dispersion compensation for an impedance-matched narrow-band quantum memory by exploiting Raman processes over two three-level atomic subensembles, one for memory and the other for dispersion compensation. Dispersion compensation provides impedance matching over more than a full cavity linewidth. Combined with one second spin-coherence lifetime the memory could be capable of power efficiency exceeding 90% leading to 106 modes for temporal multiplexing. Our design could lead to significant multiplexing enhancement for quantum repeaters to be used for telecom quantum networks.

quant-ph↗

arXiv2021

Sub-Planck structures: Analogies between the Heisenberg-Weyl and SU(2) groups

Coherent-state superpositions are of great importance for many quantum subjects, ranging from foundational to technological, e.g., from tests of collapse models to quantum metrology. Here we explore various aspects of these states, related to the connection between sub-Planck structures present in their Wigner function and their sensitivity to displacements (ultimately determining their metrological potential). We review this for the usual Heisenberg-Weyl algebra associated to a harmonic oscillator, and extend it to find analogous results for the $\mathfrak{su}(2)$ algebra, typically associated with angular momentum. In particular, in the Heisenberg-Weyl case, we identify phase-space structures with support smaller than the Planck action in both Schrödinger-cat-state mixtures and superpositions, the latter known as compass states. However, as compared to coherent states, compass states are shown to have $\sqrt{N}$-enhanced sensitivity against displacements in all phase-space directions ($N$ is the average number of quanta), whereas cat states and cat mixtures show such enhanced sensitivity only for displacements in specific directions. We then show that these same properties apply for analogous SU(2) states provided (i) coherent states are restricted to the equator of the sphere that plays the role of phase space for this group, (ii) we associate the role of the Planck action to the size of SU(2) coherent states in such a sphere, and (iii) we associate the role of $N$ with the total angular momentum.

quant-ph↗

arXiv2021

Squeezed comb states

Continuous-variable codes are an expedient solution for quantum information processing and quantum communication involving optical networks. Here we characterize the squeezed comb, a finite superposition of equidistant squeezed coherent states on a line, and its properties as a continuous-variable encoding choice for a logical qubit. The squeezed comb is a realistic approximation to the ideal code proposed by Gottesman, Kitaev, and Preskill [Phys. Rev. A 64, 012310 (2001)], which is fully protected against errors caused by the paradigmatic types of quantum noise in continuous-variable systems: damping and diffusion. This is no longer the case for the code space of finite squeezed combs, and noise robustness depends crucially on the encoding parameters. We analyze finite squeezed comb states in phase space, highlighting their complicated interference features and characterizing their dynamics when exposed to amplitude damping and Gaussian diffusion noise processes. We find that squeezed comb state are more suitable and less error-prone when exposed to damping, which speaks against standard error correction strategies that employ linear amplification to convert damping into easier-to-describe isotropic diffusion noise.

quant-ph↗

arXiv2020

Quantum Multiple Kernel Learning

Kernel methods play an important role in machine learning applications due to their conceptual simplicity and superior performance on numerous machine learning tasks. Expressivity of a machine learning model, referring to the ability of the model to approximate complex functions, has a significant influence on its performance in these tasks. One approach to enhancing the expressivity of kernel machines is to combine multiple individual kernels to arrive at a more expressive combined kernel. This approach is referred to as multiple kernel learning (MKL). In this work, we propose an MKL method we refer to as quantum MKL, which combines multiple quantum kernels. Our method leverages the power of deterministic quantum computing with one qubit (DQC1) to estimate the combined kernel for a set of classically intractable individual quantum kernels. The combined kernel estimation is achieved without explicitly computing each individual kernel, while still allowing for the tuning of individual kernels in order to achieve better expressivity. Our simulations on two binary classification problems---one performed on a synthetic dataset and the other on a German credit dataset---demonstrate the superiority of the quantum MKL method over single quantum kernel machines.

quant-ph↗

arXiv2020

Multiple uncertainty relation for accelerated quantum information

The uncertainty principle, first introduced by Heisenberg in inertial frames, clearly distinguishes quantum theories from classical mechanics. In non-inertial frames, its information-theoretic expressions, namely entropic uncertainty relations, have been extensively studied through delocalized quantum fields, and localization of the quantum fields were discussed as well. However, infeasibility of measurements applied on a delocalized quantum field due to the finite size of measurement apparatuses is left unexplained. Therefore, physical clarification of a quantum protocol revealing entropic uncertainty relations still needs investigation. Building on advances in quantum field theories and theoretical developments in entropic uncertainty relations, we demonstrate a relativistic protocol of an uncertainty game in the presence of localized fermionic quantum fields inside cavities. Moreover, a novel lower bound for entropic uncertainty relations with multiple quantum memories is given in terms of the Holevo quantity, which implies how acceleration affects uncertainty relations.

quant-ph↗

arXiv2020

Qudits and high-dimensional quantum computing

Qudit is a multi-level computational unit alternative to the conventional 2-level qubit. Compared to qubit, qudit provides a larger state space to store and process information, and thus can provide reduction of the circuit complexity, simplification of the experimental setup and enhancement of the algorithm efficiency. This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods. We first discuss the qudit gate universality and a variety of qudit gates including the pi/8 gate, the SWAP gate, and the multi-level-controlled gate. We then present the qudit version of several representative quantum algorithms including the Deutsch-Jozsa algorithm, the quantum Fourier transform, and the phase estimation algorithm. Finally we discuss various physical realizations for qudit computation such as the photonic platform, iron trap, and nuclear magnetic resonance.

quant-ph↗

arXiv2020

Creating deterministic collisions between two orbiting bodies

We aim to create deterministic collisions between orbiting bodies by applying a time-dependent external force to one or both bodies, whether the bodies are mutually repulsive, as in the two- or multi-electron atomic case or mutually attractive, as in the planetary-orbit case. Specifically, we have devised a mathematical framework for causing deterministic collisions by launching an inner orbiting body to a higher energy such that this inner body is guaranteed to collide with the outer body. Our method first expresses the problem mathematically as coupled nonlinear differential equations with a time-dependent driving force and solves to find a feasible solution for the force function. Although our calculation is based strictly on classical physics, our approach is suitable for the case of helium with two highly excited electrons and is also valid for creating collisions in the gravitational case such as for our solar system.

physics.class-ph↗