Decentralizing Feature Extraction with Quantum Convolutional Neural Network for Automatic Speech Recognition
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
SEARCH · Search NASA
Results for “Quantum Networks”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
On-demand directional microwave photon emission using waveguide quantum electrodynamics
Routing quantum information between non-local computational nodes is a foundation for extensible networks of quantum processors. Quantum information transfer between arbitrary nodes is generally mediated either by photons that propagate between them or by resonantly coupling nearby nodes. The utility is determined by the type of emitter, propagation channel and receiver. Conventional approaches involving propagating microwave photons have limited fidelity due to photon loss and are often unidirectional, whereas architectures that use direct resonant coupling are bidirectional in principle but can generally accommodate only a few local nodes. Here we demonstrate high-fidelity, on-demand, directional, microwave photon emission. We do this using an artificial molecule comprising two superconducting qubits strongly coupled to a bidirectional waveguide, effectively creating a chiral microwave waveguide. Quantum interference between the photon emission pathways from the molecule generates single photons that selectively propagate in a chosen direction. This circuit will also be capable of photon absorption, making it suitable for building interconnects within extensible quantum networks.
42 ENGINEERING↗
Study network-related optimization problems using quantum alternating optimization ansatz
Network-related connectivity optimization problems are underlying a wide range of applications and are also of high computational complexity. We consider studying network optimization problems using two types of quantum heuristics. One is quantum annealing, and the other Quantum Alternating Operator Ansatz, an extension of the Quantum Approximate Optimization Algorithms for gate-model quantum computation, in which a cost-function based unitary and a non-commuting mixing unitary are applied alternately. We present problem mappings for problems of finding the spanning-tree or spanning-graph of a graph that optimizes certain costs, and a variant that further requires the spanning-tree be degree-bounded. With quantum annealing, all constraints are cast into penalty terms in the cost Hamiltonian, and the solution is encoded as the ground state of the Hamiltonian. We provide three mappings to the quadratic unconstrained binary optimization (QUBO) form, compare the resource requirements, and analyze the tradeoffs. For QAOA, we give special focus on the design of mixers based on the constraints presented in the problem, such that the system evolution remains in a subspace of the full Hilbert space where all constraints are satisfied. In the spanning-tree problem, one such hard constraint is that a mixer applied to a spanning-tree needs also be a spanning tree. This involves checking the connectivity of a subgraph, which is a global condition common for most network-related problems. We show how this feature can be efficiently represented in the mixer in a quantum coherent way, based on manipulation of a descendant-matrix and an adjacent matrix. We further develop a mixer for the spanning-graphs based on the spanning-tree mixer.
Zhihui Wang↗
Indistinguishable telecom band photons from a single Er ion in the solid state
Atomic defects in the solid state are a key component of quantum repeater networks for long-distance quantum communication1. Recently, there has been significant interest in rare earth ions, in particular Er 3+ for its telecom band optical transition that allows long-distance transmission in optical fibres. However, the development of repeater nodes based on rare earth ions has been hampered by optical spectral diffusion, precluding indistinguishable single-photon generation. Here, we implant Er 3+ into CaWO 4 , a material that combines a non-polar site symmetry, low decoherence from nuclear spins and is free of background rare earth ions, to realize significantly reduced optical spectral diffusion. For shallow implanted ions coupled to nanophotonic cavities with large Purcell factor, we observe single-scan optical linewidths of 150 kHz and long-term spectral diffusion of 63 kHz, both close to the Purcell-enhanced radiative linewidth of 21 kHz. This enables the observation of Hong–Ou–Mandel interference between successively emitted photons with a visibility of V = 80(4)%, measured after a 36 km delay line. We also observe spin relaxation times T 1,s = 3.7 s and T 2,s > 200 μs, with the latter limited by paramagnetic impurities in the crystal instead of nuclear spins. Furthermore, this represents a notable step towards the construction of telecom band quantum repeater networks with single Er 3+ ions.
42 ENGINEERING↗
Real-time prediction of 1 H and 13 C chemical shifts with DFT accuracy using a 3D graph neural network
From quantum chemical and experimental NMR data, a 3D graph neural network, CASCADE, has been developed to predict carbon and proton chemical shifts. Stereoisomers and conformers of organic molecules can be correctly distinguished.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
On the universality of S n -equivariant k -body gates
The importance of symmetries has recently been recognized in quantum machine learning from the simple motto: if a task exhibits a symmetry (given by a group $\mathfrak{G}$), the learning model should respect said symmetry. This can be instantiated via $\mathfrak{G}$-equivariant quantum neural networks (QNNs), i.e. parametrized quantum circuits whose gates are generated by operators commuting with a given representation of $\mathfrak{G}$. In practice, however, there might be additional restrictions to the types of gates one can use, such as being able to act on at most k qubits. In this work we study how the interplay between symmetry and k-bodyness in the QNN generators affect its expressiveness for the special case of $\mathfrak{G}=S_n$, the symmetric group. Our results show that if the QNN is generated by one- and two-body Sn-equivariant gates, the QNN is semi-universal but not universal. That is, the QNN can generate any arbitrary special unitary matrix in the invariant subspaces, but has no control over the relative phases between them. Then, we show that in order to reach universality one needs to include n-body generators (if n is even) or ($n-1$)-body generators (if n is odd). As such, our results brings us a step closer to better understanding the capabilities and limitations of equivariant QNNs.
97 MATHEMATICS AND COMPUTING↗
Faster Tensor Network Decoding for Topological Quantum Codes
We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.
97 MATHEMATICS AND COMPUTING↗
Exploring Quantum State Preparation Using Tensor Networks and Sparse Wavefunction Simulations
The variational quantum eigenvalue solver is a powerful hybrid quantum-classical approach that has been suggested as a candidate method to run on near-term quantum hardware for computing ground state electronic energies of molecular systems. However, even for small molecules, the number of variational parameters and qubits required to minimize the electronic energy is beyond the reach of current quantum computers except for small basis sets. We explore a new paradigm for state preparation where we test how much of the optimization can be approximately prepared with classical computers to reduce the number of optimization steps performed using a quantum device. By adapting a recent algorithm for the factorized form of the UCC ansatz, we can study molecular electronic structure problems with up to 64 qubits. In addition, we also test a related approach of using tensor networks to optimize quantum circuits in order to benchmark various lattice models. We present results using these approaches and discuss strategies for incorporating these ideas into variational algorithms involving near-term quantum computers. Our results help demonstrate the strength of the UCC ansatz and address pressing questions about optimal initial parameterizations and circuit construction.
quantum computing↗
Learning the ground state of a non-stoquastic quantum Hamiltonian in a rugged neural network landscape
Strongly interacting quantum systems described by non-stoquastic Hamiltonians exhibit rich low-temperature physics. Yet, their study poses a formidable challenge, even for state-of-the-art numerical techniques. Here, we investigate systematically the performance of a class of universal variational wave-functions based on artificial neural networks, by considering the frustrated spin- 1/2 1 / 2 J_1-J_2 J 1 − J 2 Heisenberg model on the square lattice. Focusing on neural network architectures without physics-informed input, we argue in favor of using an ansatz consisting of two decoupled real-valued networks, one for the amplitude and the other for the phase of the variational wavefunction. By introducing concrete mitigation strategies against inherent numerical instabilities in the stochastic reconfiguration algorithm we obtain a variational energy comparable to that reported recently with neural networks that incorporate knowledge about the physical system. Through a detailed analysis of the individual components of the algorithm, we conclude that the rugged nature of the energy landscape constitutes the major obstacle in finding a satisfactory approximation to the ground state wavefunction, and prevents learning the correct sign structure. In particular, we show that in the present setup the neural network expressivity and Monte Carlo sampling are not primary limiting factors.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
The Concept of a Quantum Edge Simulator: Edge Computing and Sensing in the Quantum Era
Sensors, enabling observations across vast spatial, spectral, and temporal scales, are major data generators for information technology (IT). Processing, storing, and communicating this ever-growing amount of data pose challenges for the current IT infrastructure. Edge computing—an emerging paradigm to overcome the shortcomings of cloud-based computing—could address these challenges. Furthermore, emerging technologies such as quantum computing, quantum sensing, and quantum communications have the potential to fill the performance gaps left by their classical counterparts. Here, we present the concept of an edge quantum computing (EQC) simulator—a platform for designing the next generation of edge computing applications. An EQC simulator is envisioned to integrate elements from both quantum technologies and edge computing to allow studies of quantum edge applications. The presented concept is motivated by the increasing demand for more sensitive and precise sensors that can operate faster at lower power consumption, generating both larger and denser datasets. These demands may be fulfilled with edge quantum sensor networks. Envisioning the EQC era, we present our view on how such a scenario may be amenable to quantification and design. Given the cost and complexity of quantum systems, constructing physical prototypes to explore design and optimization spaces is not sustainable, necessitating EQC infrastructure and component simulators to aid in co-design. We discuss what such a simulator may entail and possible use cases that invoke quantum computing at the edge integrated with new sensor infrastructures.
47 OTHER INSTRUMENTATION↗
Hyperentangled Time-Bin and Polarization Quantum Key Distribution
Fiber-based quantum communication networks are currently limited without quantum repeaters. Satellite-based quantum links have been proposed to extend the network domain. Here, we develop a quantum communication system, suitable for realistic satellite-to-ground communication. With this system, we execute an entanglement-based quantum key distribution (QKD) protocol developed by Bennett, Brassard, and Mermin (BBM92), achieving quantum bit-error rates (QBERs) below 2% in all bases. More importantly, we demonstrate low-QBER execution of a higher-dimensional hyperentanglement-based QKD protocol, using photons simultaneously entangled in polarization and time bin, leading to significantly higher secure key rates, at the cost of increased technical complexity and system size. We show that our protocol is suitable for a space-to-ground link, after incorporating Doppler-shift compensation, and verify its security using a rigorous finite-key analysis. Additionally, we discuss system-engineering considerations relevant to those and other quantum communication protocols and their dependence on what photonic degrees of freedom are utilized.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
4-Clique network minor embedding for quantum annealers
Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
A characterization of quantum Kerr optical frequency combs
Quantum Kerr optical frequency combs are generated by pumping a high-Q microresonator with a continuous wave resonant laser. Below threshold, two pump photons are symmetrically up- and down-converted as twin photons via spontaneous four-wave mixing, thereby generating up to a hundred paired channels. Furthermore, these chipscale, high-dimensional and room-temperature systems are expected to play a major role in quantum engineering. However, their theoretical description is still unclear. Here, we present an explicit description of this quantum system via a frequency-bin state and its density operator, and explore the properties of the eigenkets.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Degradation of Ta 2 O 5 / SiO 2 dielectric cavity mirrors in ultra-high vacuum
In order for optical cavities to enable strong light-matter interactions for quantum metrology, networking, and scalability in quantum computing systems, their mirrors must have minimal losses. However, high-finesse dielectric cavity mirrors can degrade in ultra-high vacuum (UHV), increasing the challenges of upgrading to cavity-coupled quantum systems. We observe the optical degradation of high-finesse dielectric optical cavity mirrors after high-temperature UHV bake in the form of a substantial increase in surface roughness. We provide an explanation of the degradation through atomic force microscopy (AFM), X-ray fluorescence (XRF), selective wet etching, and optical measurements. We find the degradation is explained by oxygen reduction in Ta 2 O 5 followed by growth of tantalum sub-oxide defects with height to width aspect ratios near ten. We discuss the dependence of mirror loss on surface roughness and finally give recommendations to avoid degradation to allow for quick adoption of cavity-coupled systems.
Optics↗
Neural Network Solver for Small Quantum Clusters
Machine learning approaches have recently been applied to the study of various problems in physics. Most of these studies are focused on interpreting the data generated by conventional numerical methods or the data on an existing experimental database. An interesting question is whether it is possible to use a machine learning approach, in particular a neural network, for solving the many-body problem. In this paper, we present a neural network solver for the single impurity Anderson model, the paradigm of an interacting quantum problem in small clusters. We demonstrate that the neural-network-based solver provides quantitative accurate results for the spectral function as compared to the exact diagonalization method. This opens the possibility of utilizing the neural network approach as an impurity solver for other many-body numerical approaches, such as the dynamical mean field theory.
36 MATERIALS SCIENCE↗
Quantum reservoir computing implementation on coherently coupled quantum oscillators
Quantum reservoir computing is a promising approach for quantum neural networks, capable of solving hard learning tasks on both classical and quantum input data. However, current approaches with qubits suffer from limited connectivity. We propose an implementation for quantum reservoir that obtains a large number of densely connected neurons by using parametrically coupled quantum oscillators instead of physically coupled qubits. We analyze a specific hardware implementation based on superconducting circuits: with just two coupled quantum oscillators, we create a quantum reservoir comprising up to 81 neurons. We obtain state-of-the-art accuracy of 99% on benchmark tasks that otherwise require at least 24 classical oscillators to be solved. Our results give the coupling and dissipation requirements in the system and show how they affect the performance of the quantum reservoir. Beyond quantum reservoir computing, the use of parametrically coupled bosonic modes holds promise for realizing large quantum neural network architectures, with billions of neurons implemented with only 10 coupled quantum oscillators.
97 MATHEMATICS AND COMPUTING↗
Quapprox: A Framework for Benchmarking the Approximability of Variational Quantum Circuit
Most of the existing quantum neural network models, such as variational quantum circuits (VQCs), are limited in their ability to explore the non-linear relationships in input data. This gradually becomes the main obstacle for it to tackle realistic applications, such as natural language processing, medical image processing, and wireless communications. Recently, there have emerged research efforts that enable VQCs to perform non-linear operations. However, it is still unclear on the approximability of a given VQC (i.e., the order of non-linearity that can be handled by a specified design). In response to this issue, we developed an automated tool designed to benchmark the approximation of a given VQC. The proposed tool will generate a set of synthetic datasets with different orders of non-linearity and train the given VQC on these datasets to estimate their approximability. Our experiments benchmark VQCs with different designs, where we know their theoretic approximability. We then show that the proposed tool can precisely estimate the approximability, which is consistent with the theoretic value, indicating that the proposed tool can be used for benchmarking the approximability of a given quantum circuit for learning tasks.
artificial intelligence↗
Variational quantum reinforcement learning via evolutionary optimization
Abstract Recent advances in classical reinforcement learning (RL) and quantum computation point to a promising direction for performing RL on a quantum computer. However, potential applications in quantum RL are limited by the number of qubits available in modern quantum devices. Here, we present two frameworks for deep quantum RL tasks using gradient-free evolutionary optimization. First, we apply the amplitude encoding scheme to the Cart-Pole problem, where we demonstrate the quantum advantage of parameter saving using amplitude encoding. Second, we propose a hybrid framework where the quantum RL agents are equipped with a hybrid tensor network-variational quantum circuit (TN-VQC) architecture to handle inputs of dimensions exceeding the number of qubits. This allows us to perform quantum RL in the MiniGrid environment with 147-dimensional inputs. The hybrid TN-VQC architecture provides a natural way to perform efficient compression of the input dimension, enabling further quantum RL applications on noisy intermediate-scale quantum devices.
97 MATHEMATICS AND COMPUTING↗