Abstract: Randomized algorithms are crucial subroutines in quantum computing, but the requirement to execute many types of circuits on a real quantum device has been challenging to their extensive implementation. In this study, we propose an engineering method to reduce the executing time for randomized algorithms using dynamic circuits, i.e., quantum circuits involving intermediate measurement […]
Abstract: We present an information-theoretic approach to quantum state classification based on sequential Bayesian inference. In each measurement step, the algorithm updates a probability distribution over candidate states by applying Bayes’ rule to the observed outcome. For each measurement shot on an unknown quantum state, the algorithm selects the observable with the highest expected information […]
Abstract: This article proposes a novel beam selection method using a multiarmed bandit (MAB) algorithm based on a quantum walk (QW) principle, aimed at improving system performance. A massive multiple-input multiple-output system, employing multiple high-gain beams within a high-frequency band, is indispensable for achieving large capacity in future wireless communications. However, as the number of […]
Recently, several continuous-variable quantum secret sharing (CV-QSS) protocols were proposed, while most of them are limited to the fiber channel systems with a relatively stable transmissivity. However, by means of complex channels, the transmissivity fluctuates dramatically in time with a probability distribution, which will lead to a fast-fluctuating attack. Therefore, the security analysis of CV-QSS […]
Quantum walks play an important role for developing quantum algorithms and quantum simulations. Here, we introduce a first of its kind one-dimensional lazy quantum walk in the ternary quantum domain and show its equivalence for circuit realization in ternary quantum logic. Using an appropriate logical mapping of the position space on which a walker evolves […]