Estimation of the CHSH Parameter Using HOM Interference

The Clauser–Horne–Shimony–Holt (CHSH) experiment is an essential test of nonlocality in quantum mechanics and can be used to validate the principle of entanglement. In addition to verifying entanglement, the measurable CHSH parameter can also be used to gauge the quality of the entanglement present in a system. The measurement of Hong–Ou–Mandel (HOM) interference is another […]

DQRA: Deep Quantum Routing Agent for Entanglement Routing in Quantum Networks

Quantum routing plays a key role in the development of the next-generation network system. In particular, an entangled routing path can be constructed with the help of quantum entanglement and swapping among particles (e.g., photons) associated with nodes in the network. From another side of computing, machine learning has achieved numerous breakthrough successes in various […]

Versatile and Concurrent FPGA-Based Architecture for Practical Quantum Communication Systems

This article presents a hardware and software architecture, which can be used in those systems that implement practical quantum key distribution (QKD) and quantum random-number generation (QRNG) schemes. This architecture fully exploits the capability of a System on a Chip (SoC), which comprehends both a field-programmable gate array (FPGA) and a dual-core CPU unit. By […]

Machine-Learning-Based Parameter Estimation of Gaussian Quantum States

In this article, we propose a machine-learning framework for parameter estimation of single-mode Gaussian quantum states. Under a Bayesian framework, our approach estimates parameters of suitable prior distributions from measured data. For phase-space displacement and squeezing parameter estimation, this is achieved by introducing expectation–maximization (EM)-based algorithms, while for phase parameter estimation, an empirical Bayes method […]

Long-Term Secure Distributed Storage Using Quantum Key Distribution Network With Third-Party Verification

The quantum key distribution (QKD) network with Vernam’s one-time pad encryption and secret sharing are powerful security tools to realize an information theoretically secure (ITS) distributed storage system. In the work of Fujiwara et al., a single-password-authenticated secret sharing (SPSS) scheme based on the QKD network and Shamirs secret sharing was experimentally demonstrated; it confirmed ITS […]

High-Stability Cryogenic System for Quantum Computing With Compact Packaged Ion Traps

Cryogenic environments benefit ion trapping experiments by offering lower motional heating rates, collision energies, and an ultrahigh vacuum (UHV) environment for maintaining long ion chains for extended periods of time. Mechanical vibrations caused by compressors in closed-cycle cryostats can introduce relative motion between the ion and the wavefronts of lasers used to manipulate the ions. […]

Classically Optimal Variational Quantum Algorithms

Hybrid quantum-classical algorithms, such as variational quantum algorithms (VQAs), are suitable for implementation on noisy intermediate-scale quantum computers. In this article, we expand an implicit step of VQAs: the classical precomputation subroutine, which can nontrivially use classical algorithms to simplify, transform, or specify problem instance-specific variational quantum circuits. In VQA, there is a tradeoff between […]

New Single-Preparation Methods for Unsupervised Quantum Machine Learning Problems

The term “machine learning” especially refers to algorithms that derive mappings, i.e., input–output transforms, by using numerical data that provide information about considered transforms. These transforms appear in many problems related to classification/clustering, regression, system identification, system inversion, and input signal restoration/separation. We here analyze the connections between all these problems in the classical and […]

Finding Solutions to the Integer Case Constraint Satisfiability Problem Using Grover’s Algorithm

Constraint satisfiability problems, crucial to several applications, are solved on a quantum computer using Grover’s search algorithm, leading to a quadratic improvement over the classical case. The solutions are obtained with high probability for several cases and are illustrated for the cases involving two variables for both 3- and 4-bit numbers. Methods are defined for […]

Quantum Circuit Architecture Optimization for Variational Quantum Eigensolver via Monto Carlo Tree Search

The advent of noisy intermediate-scale quantum (NISQ) devices provide crucial promise for the development of quantum algorithms. Variational quantum algorithms have emerged as one of the best hopes to utilize NISQ devices. Among these is the famous variational quantum eigensolver (VQE), where one trains a parameterized and fixed quantum circuit (or an ansatz) to accomplish […]