ﻻ يوجد ملخص باللغة العربية
Quantum computational approaches to some classic target identification and localization algorithms, especially for radar images, are investigated, and are found to raise a number of quantum statistics and quantum measurement issues with much broader applicability. Such algorithms are computationally intensive, involving coherent processing of large sensor data sets in order to extract a small number of low profile targets from a cluttered background. Target enhancement is accomplished through accurate statistical characterization of the environment, followed by optimal identification of statistical outliers. The key result of the work is that the environmental covariance matrix estimation and manipulation at the heart of the statistical analysis actually enables a highly efficient quantum implementation. The algorithm is inspired by recent approaches to quantum machine learning, but requires significant extensions, including previously overlooked `quantum analog--digital conversion steps (which are found to substantially increase the required number of qubits), `quantum statistical generalization of the classic phase estimation and Grover search algorithms, and careful consideration of projected measurement operations. Application regimes where quantum efficiencies could enable significant overall algorithm speedup are identified. Key possible bottlenecks, such as data loading and conversion, are identified as well.
We give efficient quantum algorithms to estimate the partition function of (i) the six vertex model on a two-dimensional (2D) square lattice, (ii) the Ising model with magnetic fields on a planar graph, (iii) the Potts model on a quasi 2D square latt
In this work we investigate quantum-enhanced target detection in the presence of large background noise using multidimensional quantum correlations between photon pairs generated through spontaneous parametric down-conversion. Until now similar exper
We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and study thei
We consider the task of estimating the expectation value of an $n$-qubit tensor product observable $O_1otimes O_2otimes cdots otimes O_n$ in the output state of a shallow quantum circuit. This task is a cornerstone of variational quantum algorithms f
As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a theoretical po