Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Ultra-fast wave-optical computing

Tobias J. Haist

Published Aug 28, 2008• 2 citations
Publisher

Abstract

I present a method for optical computing based on white-light interferometry. The problem to be solved is coded by optical path lengths and the superposition of all possible paths that a photon can travel is used for computing the solution. The solution itself is chosen by interference with the reference light. Several gedankenexperiments demonstrate how this method can be used for solving computational hard problems. Especially, I will introduce the basic principle with two maze-type puzzles and then concentrate on how the method can be employed for performing ultra-fast (sub-ps) digital-optical arithmetic with arbitrary precision.

DOI
10.1117/12.794843

Related papers

An Optical Solution For The Traveling Salesman Problem

Tobias J. Haist, Wolfgang Osten

We introduce an optical method based on white light interferometry in order to solve the well-known NP-complete traveling salesman problem. To our knowledge it is the first time that a method for the reduction of non-polynomial time to quadratic time has been proposed. We will show that this achievement is limited by the number of available photons for solving the problem. It will turn out that this number of photons is proportional to N(N) for a traveling salesman problem with N cities and that for large numbers of cities the method in practice therefore is limited by the signal-to-noise ratio. The proposed method is meant purely as a gedankenexperiment.

Optics Express•Jan 1, 2007•58 citations

White-light interferometric computing and secure data transmission

Tobias J. Haist, Wolfgang Osten

White-light interferometry can be used for solving difficult problems in the field of information science. We give an overview of the method and show examples from ultrafast computing, NP-problems, measurement systems and secure key distribution.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Aug 1, 2009•0 citations

Key technologies toward ultra-fast optical quantum computers

Mamoru Endo, Akira Furusawa

Quantum computers harnessing the principles of quantum mechanics hold the potential to outperform classical systems. Continuous-variable quantum information processing with light offers advantages such as THz-order clock frequencies, scalability via temporal multiplexing, and compatibility with ultra-fast optical communication technologies. This type of quantum computer can be described as an ultra-fast analog quantum computer, making it particularly well-suited for applications involving continuous variables, such as neural networks and optimization problems. However, challenges in universal computation and error correction persist due to weak light-matter interactions. This presentation introduces our advancements in optical quantum computing using waveguide optical parametric amplifiers (OPAs) and non-Gaussian quantum state generation with photon-number resolving detectors (PNRDs). We also propose an all-optical scheme leveraging OPAs to achieve fault-tolerant quantum computing, enabling logical qubit generation and clock frequencies exceeding THz.

Quantum Computing, Communication, and Simulation•Mar 19, 2025•1 citation

Chirped-pulse interferometry: Classical dispersion cancellation and analogues of two-photon quantum interference

Jonathan Lavoie

Interference has long been used for precision measurement of path-length changes. Since the advent of the laser, interference has become one of the most versatile tools in metrology. Specifically, ultra-short laser pulses allow unprecedented resolution in absolute length measurements. While ultra-short laser pulses lead to high resolution, for example in white-light interferometry, they are very susceptible to dispersion. \n \nQuantum resources have been proposed to overcome some of the problems related to distortions in the interferometric signal. For example, the Hong-Ou-Mandel (HOM) interferometer relies on frequency-entangled photon pairs and features automatic even-order dispersion cancellation and high interference visibility resilient to unbalanced loss. Quantum-OCT is a technique based on HOM interferometry, that promises to overcome Optical Coherence Tomography (OCT) a classical imaging technique based on low coherence light. Furthermore, straightforward modifications of the HOM interferometer can display several different interferometric signals, including the HOM peak, quantum beating, and phase super-resolution. However, the quantum resources required are hard to produce and dim, leading to long integration times and single-photon counting. \n \nIn this thesis, we introduce the theory behind Chirped-Pulse Interferometry (CPI), a new technique that combines all the advantages of Q-OCT, including even-order dispersion cancellation, but without the need for any quantum resources. We then experimentally implement CPI and demonstrate all the important characteristics shared by the HOM interferometer, but at dramatically larger signal levels. We show how CPI can be used to measure dispersion cancelled axial profiles of an optical sample and show the improvement in resolution over white-light interferometry. Finally, we show that by modifying CPI in analogous ways to HOM, CPI can also be made to produce interferometric signal identical to the HOM peak, quantum beating, and phase super-resolution.

•Oct 9, 2009•0 citations

New directions in optical quantum computing

Timothy C. Ralph

We will discuss new sampling algorithms that are hard for classical computers but can be solved with linear optical quantum processors and techniques for implementing universal quantum gates using strong optical non-linearities and Gaussian optics.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Aug 1, 2015•0 citations

Sensing the insensible using optical schemes: converting the maze problem into a quantum search problem

Debabrata Goswami

Many large image processing and data processing scenarios can soon develop into maze problems requiring, say, finding the longest possible path, which are unresponsive, intractable, and challenging to analyze! Such maze problems, of which the traveling salesman decision problem is a special case, are of the Non-determinate Polynomial (NPcomplete) class of problems that are often impossible to solve with finite time and storage. We propose a novel methodology to approach this class of NP-complete problems. We convert a suitably formulated maze problem into a Quantum Search Problem (QSP), and the desired solutions are then sought using the iterative Grover’s Search Algorithm. Thus, we reformulate the entire class of such NP-problems into QSPs. Our current solution deals with two-dimensional perfect mazes with no closed loops. We encode all possible individual paths from the starting point of the maze into a quantum register. A quantum fitness operator applied to the register encodes each qubit with its fitness value. We propose the design of an optical oracle that marks all entities above a certain fitness value and uses the Grover search algorithm to find the optimal marked state in an iterative manner.

•Apr 23, 2020•0 citations
I present a method for optical computing based on white-light interferometry. The problem to be solved is coded by optical path lengths and the superposition of all possible paths that a photon can travel is used for computing the solution. The solution itself is chosen by interference with the reference light. Several gedankenexperiments demonstrate how this method can be used for solving computational hard problems. Especially, I will introduce the basic principle with two maze-type puzzles and then concentrate on how the method can be employed for performing ultra-fast (sub-ps) digital-optical arithmetic with arbitrary precision.
We introduce an optical method based on white light interferometry in order to solve the well-known NP-complete traveling salesman problem. To our knowledge it is the first time that a method for the reduction of non-polynomial time to quadratic time has been proposed. We will show that this achievement is limited by the number of available photons for solving the problem. It will turn out that this number of photons is proportional to N(N) for a traveling salesman problem with N cities and that for large numbers of cities the method in practice therefore is limited by the signal-to-noise ratio. The proposed method is meant purely as a gedankenexperiment.
Quantum computers harnessing the principles of quantum mechanics hold the potential to outperform classical systems. Continuous-variable quantum information processing with light offers advantages such as THz-order clock frequencies, scalability via temporal multiplexing, and compatibility with ultra-fast optical communication technologies. This type of quantum computer can be described as an ultra-fast analog quantum computer, making it particularly well-suited for applications involving continuous variables, such as neural networks and optimization problems. However, challenges in universal computation and error correction persist due to weak light-matter interactions. This presentation introduces our advancements in optical quantum computing using waveguide optical parametric amplifiers (OPAs) and non-Gaussian quantum state generation with photon-number resolving detectors (PNRDs). We also propose an all-optical scheme leveraging OPAs to achieve fault-tolerant quantum computing, enabling logical qubit generation and clock frequencies exceeding THz.
Interference has long been used for precision measurement of path-length changes. Since the advent of the laser, interference has become one of the most versatile tools in metrology. Specifically, ultra-short laser pulses allow unprecedented resolution in absolute length measurements. While ultra-short laser pulses lead to high resolution, for example in white-light interferometry, they are very susceptible to dispersion. \n \nQuantum resources have been proposed to overcome some of the problems related to distortions in the interferometric signal. For example, the Hong-Ou-Mandel (HOM) interferometer relies on frequency-entangled photon pairs and features automatic even-order dispersion cancellation and high interference visibility resilient to unbalanced loss. Quantum-OCT is a technique based on HOM interferometry, that promises to overcome Optical Coherence Tomography (OCT) a classical imaging technique based on low coherence light. Furthermore, straightforward modifications of the HOM interferometer can display several different interferometric signals, including the HOM peak, quantum beating, and phase super-resolution. However, the quantum resources required are hard to produce and dim, leading to long integration times and single-photon counting. \n \nIn this thesis, we introduce the theory behind Chirped-Pulse Interferometry (CPI), a new technique that combines all the advantages of Q-OCT, including even-order dispersion cancellation, but without the need for any quantum resources. We then experimentally implement CPI and demonstrate all the important characteristics shared by the HOM interferometer, but at dramatically larger signal levels. We show how CPI can be used to measure dispersion cancelled axial profiles of an optical sample and show the improvement in resolution over white-light interferometry. Finally, we show that by modifying CPI in analogous ways to HOM, CPI can also be made to produce interferometric signal identical to the HOM peak, quantum beating, and phase super-resolution.
Many large image processing and data processing scenarios can soon develop into maze problems requiring, say, finding the longest possible path, which are unresponsive, intractable, and challenging to analyze! Such maze problems, of which the traveling salesman decision problem is a special case, are of the Non-determinate Polynomial (NPcomplete) class of problems that are often impossible to solve with finite time and storage. We propose a novel methodology to approach this class of NP-complete problems. We convert a suitably formulated maze problem into a Quantum Search Problem (QSP), and the desired solutions are then sought using the iterative Grover’s Search Algorithm. Thus, we reformulate the entire class of such NP-problems into QSPs. Our current solution deals with two-dimensional perfect mazes with no closed loops. We encode all possible individual paths from the starting point of the maze into a quantum register. A quantum fitness operator applied to the register encodes each qubit with its fitness value. We propose the design of an optical oracle that marks all entities above a certain fitness value and uses the Grover search algorithm to find the optimal marked state in an iterative manner.