English
Related papers

Related papers: Linear-Optical Implementation of Perfect Discrimin…

200 papers

In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the…

Quantum Physics · Physics 2008-12-16 Jonathan Robert Niel de Beaudrap

Quantum state discrimination underlies various applications in quantum information processing tasks. It essentially describes the distinguishability of quantum systems in different states, and the general process of extracting classical…

Quantum Physics · Physics 2017-07-12 Joonwoo Bae , Leong-Chuan Kwek

We describe applications of two-dimensional subwavelength quantum emitter arrays as efficient optical elements in the linear regime. For normally incident light, the cooperative optical response, stemming from emitter-emitter dipole…

Quantum Physics · Physics 2023-02-15 Nico S. Bassler , Michael Reitz , Kai P. Schmidt , Claudiu Genes

We address the problem of unambiguous comparison of a pair of unknown qudit unitary channels. Using the framework of process positive operator valued measures (PPOVM) we characterize all solutions and identify the optimal ones. We prove…

Quantum Physics · Physics 2009-01-09 Michal Sedlak , Mario Ziman

Quantum mechanics forbids deterministic discrimination among non-orthogonal states. Nonetheless, the capability to distinguish nonorthogonal states unambiguously is an important primitive in quantum information processing. In this work, we…

Quantum Physics · Physics 2016-08-16 Masoud Mohseni , Aephraim M. Steinberg , János A. Bergou

The required set of operations for universal continuous-variable quantum computation can be divided into two primary categories: Gaussian and non-Gaussian operations. Furthermore, any Gaussian operation can be decomposed as a sequence of…

Quantum Physics · Physics 2020-02-12 Kunal Sharma , Mark M. Wilde

Binary linear classification has been explored since the very early days of the machine learning literature. Perhaps the most classical algorithm is the Perceptron, where a weight vector used to classify examples is maintained, and additive…

Machine Learning · Computer Science 2020-11-18 Rafael Hanashiro , Jacob Abernethy

The characterization of a unitary gate is experimentally accomplished via Quantum Process Tomography, which combines the outcomes of different projective measurements to reconstruct the underlying operator. The process matrix is typically…

Quantum Physics · Physics 2025-09-17 Tareq Jaouni , Francesco Di Colandrea , Lorenzo Amato , Filippo Cardano , Ebrahim Karimi

One of the challenges in quantum information is the demonstration of quantum coherence in the operations of experimental devices. While full quantum process tomography can do the job, it is both cumbersome and unintuitive. In this…

Quantum Physics · Physics 2007-05-23 Holger F. Hofmann , Ryo Okamoto , Shigeki Takeuchi

Tensor processing is the cornerstone of modern technological advancements, powering critical applications in data analytics and artificial intelligence. While optical computing offers exceptional advantages in bandwidth, parallelism, and…

When designing multispectral imaging systems for classifying different spectra it is necessary to choose a small number of filters from a set with several hundred different ones. Tackling this problem by full search leads to a tremendous…

Image and Video Processing · Electrical Eng. & Systems 2023-01-19 Frank Sippel , Jürgen Seiler , André Kaup

Reversing unitary operations is a key task in quantum computing and quantum control. In this work, we introduce and develop the framework of shadow unitary inversion, a relaxed variant of unitary inversion in which the goal is to reproduce…

Quantum Physics · Physics 2026-05-29 Guocheng Zhen , Yu-Ao Chen , Mingrui Jing , Jingu Xie , Ranyiliu Chen , Xin Wang

Many emerging computer applications require the processing of large numbers, larger than what a CPU can handle. In fact, the top of the line PCs can only manipulate numbers not longer than 32 bits or 64 bits. This is due to the size of the…

Data Structures and Algorithms · Computer Science 2012-04-03 Youssef Bassil , Aziz Barbar

We demonstrate a device that allows for the coherent analysis of a pair of optical frequency sidebands in an arbitrary basis. We show that our device is quantum noise limited and hence applications for this scheme may be found in discrete…

Quantum Physics · Physics 2009-11-11 E. H. Huntington , G. N. Milford , C. Robilliard , T. C. Ralph

Unambiguously distinguishing between nonorthogonal but linearly independent quantum states is a challenging problem in quantum information processing. In this work, an exact analytic solution to an optimum measurement problem involving an…

Quantum Physics · Physics 2009-11-13 M. A. Jafarizadeh , M. Rezaei , N. Karimi , A. R. Amiri

We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a…

Quantum Physics · Physics 2007-05-23 Daniel E. Browne , Terry Rudolph

We introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as special cases quantum states, effects, and…

Quantum Physics · Physics 2008-10-22 G. Chiribella , G. M. D'Ariano , P. Perinotti

The evolution of quantum light through linear optical devices can be described by the scattering matrix $S$ of the system. For linear optical systems with $m$ possible modes, the evolution of $n$ input photons is given by a unitary matrix…

Quantum Physics · Physics 2025-01-17 Juan Carlos Garcia-Escartin , Vicent Gimeno , Julio José Moyano-Fernández

Parametric linear programming is a central operation for polyhedral computations, as well as in certain control applications.Here we propose a task-based scheme for parallelizing it, with quasi-linear speedup over large problems.This type…

Computational Geometry · Computer Science 2020-10-01 Camille Coti , David Monniaux , Hang Yu

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Logic in Computer Science · Computer Science 2024-11-14 Arka Ghosh , Piotr Hofman , Sławomir Lasota