Learning Circular Hidden Quantum Markov Models: A Tensor Network Approach

This article proposes circular hidden quantum Markov models (c-HQMMs), which can be applied for modeling temporal data. We show that c-HQMMs are equivalent to a tensor network (more precisely, circular local purified state) model. This equivalence enables us to provide an efficient learning model for c-HQMMs. The proposed learning approach is evaluated on six real […]

Spatiotemporal Multiplexed Rydberg Receiver

Rydberg states of alkali atoms, where the outer valence electron is excited to high principal quantum numbers, have large electric dipole moments allowing them to be used as sensitive, wideband, electric field sensors. These sensors use electromagnetically induced transparency (EIT) to measure incident electric fields. The characteristic timescale necessary to establish EIT determines the effective […]

Private Product Computation Using Quantum Entanglement

In this article, we show that a pair of entangled qubits can be used to compute a product privately. More precisely, two participants with a private input from a finite field can perform local operations on a shared, Bell-like quantum state, and when these qubits are later sent to a third participant, the third participant […]

Emulation of Quantum Algorithms Using CMOS Analog Circuits

Quantum computers are regarded as the future of computing, as they are believed to be capable of solving extremely complex problems that are intractable on conventional digital computers. However, near-term quantum computers are prone to a plethora of noise sources that are difficult to mitigate, possibly limiting their scalability and precluding us from running any […]

Hybrid Quantum–Classical Generative Adversarial Network for High-Resolution Image Generation

Quantum machine learning (QML) has received increasing attention due to its potential to outperform classical machine learning methods in problems, such as classification and identification tasks. A subclass of QML methods is quantum generative adversarial networks (QGANs), which have been studied as a quantum counterpart of classical GANs widely used in image manipulation and generation […]

Shor’s Algorithm Using Efficient Approximate Quantum Fourier Transform

Shor’s algorithm solves the integer factoring and discrete logarithm problems in polynomial time. Therefore, the evaluation of Shor’s algorithm is essential for evaluating the security of currently used public-key cryptosystems because the integer factoring and discrete logarithm problems are crucial for the security of these cryptosystems. In this article, a new approximate quantum Fourier transform […]

Time Binning Method for Nonpulsed Sources Characterization With a Superconducting Photon Number Resolving Detector

Photon number resolving detectors find space in many fields, such as quantum optics, boson sampling, and fluorescence spectroscopy. In particular, the reconstruction of the input photon distribution is essential in quantum communications to detect photon-number-splitting attacks. In this work, we discuss the operation configurations of a photon number resolving detector based on superconducting nanostrips at […]

Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing (May 2023)

Collateral optimization refers to the systematic allocation of financial assets to satisfy obligations or secure transactions while simultaneously minimizing costs and optimizing the usage of available resources. This involves assessing the number of characteristics, such as the cost of funding and quality of the underlying assets to ascertain the optimal collateral quantity to be posted […]

Improving Urban Traffic Mobility via a Versatile Quantum Annealing Model

The growth of cities and the resulting increase in vehicular traffic pose significant challenges to the environment and citizens’ quality of life. To address these challenges, a new algorithm has been proposed that leverages the quantum annealing paradigm and D-wave’s machines to optimize the control of traffic lights in cities. The algorithm considers traffic information […]

A Stable Hash Function Based on Parity-dependent Quantum Walks with Memory (August 2023)

In this paper, we develop a generic controlled alternate quantum-walk model (called CQWMP) by combining parity-dependent quantum walks with distinct arbitrary memory lengths and propose a hash function (called QHFM-P) based on this model. The statistical properties of the proposed scheme are stable with respect to the coin parameters of the underlying controlled quantum walks; […]