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

Lecture notes in computer science

On the Computational Power of a Continuous-space Optical Model of Computation

Thomas J. Naughton, Damien Woods

Published Jan 1, 2001• 24 citations
Publisher
DOI
10.1007/3-540-45132-3_20

Related papers

On the Computational Powerof a Continuous-Space Optical Modelof Computation

Thomas J. Naughton, Damien Woods

Springer eBooks•Jan 1, 2001•0 citations

Realization of Multi-Valued Logic Using Optical Quantum Computing

Sophie Choe

Quantum computing is a paradigm of computing using physical systems, which operate according to quantum mechanical principles. Since 2017, functioning quantum processing units with limited capabilities are available on the cloud. There are two models of quantum computing in the literature: discrete variable and continuous variable models. The discrete variable model is an extension of the binary logic of digital computing with quantum bits |0⟩ and |1⟩ . In the continuous variable model, the quantum state space is infinite-dimensional and the quantum state is expressed with an infinite number of basis elements. In the physical implementation of quantum computing, however, the quantized energy levels of the electromagnetic field come in multiple values, naturally realizing the multi-valued logic of computing. Hence, to implement the discrete variable model (binary logic) of quantum computing, the temperature control is needed to restrict the energy levels to the lowest two to express the binary quantum states |0⟩ and |1⟩. The physical realization of the continuous variable model naturally implements the multi-valued logic of computing because any physical system always has the highest level of quantized energy observed i.e., the quantum state space is always finite dimensional. In 2001, Knill, Laflamme, and Milburn proved that linear optics realizes universal quantum computing in the qubit-based model. Optical quantum computers by Xanadu, under the phase space representation of quantum optics, naturally realizes the multi-valued logic of quantum computing at room temperature. Optical quantum computers use optical signals, which are most compatible with the fiber optics communication network. They are easily fabricable for mass production, robust to noise, and have low latency. Optical quantum computing provides flexibility to the users for determining the dimension of the computational space for each instance of computation. Additionally, nonlinear quantum optical effects are incorporated as nonlinear quantum gates. That flexibility of user-defined dimension of the computational space and availability of nonlinear gates lead to a faithful implementation of quantum neural networks in optical quantum computing. This dissertation provides a full description of a multi-class data quantum classifier on ten classes of the MNIST dataset. In this dissertation, I provide the background information of optical quantum computing as an ideal candidate material for building the future classical-quantum hybrid internet for its numerous benefits, among which the compatibility with the existing communications/computing infrastructure is a main one. I also show that optical quantum computing can be a hardware platform for realizing the multi- valued logic

•Mar 24, 2023•1 citation

An optical model of computation

Damien Woods, Thomas J. Naughton

Theoretical Computer Science•Aug 5, 2004•48 citations

Continuous-space model of computation is Turing universal

Thomas J. Naughton

Our model of computation (theoretical machine) was designed for the analysis of analog Fourier optical processors, its basic data unit being a continuous image of unbounded resolution. In this paper, we demonstrate the universality of our machine by presenting a framework for arbitrary Turing machine simulation. Computational complexity benefits are also demonstrated by providing a O(log2n) algorithm for a search problem that has a lower bound of n - 1 on a Turing machine.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Nov 17, 2000•14 citations

A physical and universal model of bosonic computations with Solovay-Kitaev theorem

Dorian Rudolph, Arsalan Motamedi, Dhruva Sambrani +4 more

Bosonic quantum systems are among the leading architectures for quantum information processing, offering continuous-variable degrees of freedom with strong error-correction capabilities. However, standard bosonic quantum computation models such as the Lloyd-Braunstein [Lloyd and Braunstein, 1999] and hybrid oscillator-qubit models [Brenner, Dias, and Koenig, 2025; Liu et al., 2026] permit dramatic energy growth, leading to unphysical computational power and the breakdown of fundamental algorithmic tools such as universal and efficient compilation [Brenner et al., 2026; Rudolph et al., 2025]. To address this, we introduce a new model of bosonic quantum computation, Bosonic Energy-Preserving Quantum Computation (BEQC), in which energy is treated as a computational resource. Namely, energy is supplied solely through input coherent states, and all gates are generated by energy-preserving Hamiltonians. Thus, by construction, dramatic energy growth is impossible, making the model physically grounded. We next show that BEQC is a computationally robust and universal model in many respects, including: (1. Computational power) BEQC efficiently simulates all polynomial-energy computations in existing models, and exactly recovers BQP in the polynomial energy setting. It further admits several complexity-theoretic upper bounds when varying the energy, precision, and space parameters of the model. (2. Universal gate sets and state synthesis) BEQC has natural universal gate sets based on linear optics and Kerr interactions. In particular, we obtain a Solovay-Kitaev theorem which circumvents previous no-go results. We give various applications, including (a) a protocol for engineering GKP states with rigorous preparation guarantees, (b) Fock state preparation to exponential precision, and (c) native Fock space simulation of any qubit-based unitary.

quant-pharXiv:2609.40226•Oct 1, 2026•0 citations

The role of nonlocality in optical computing

Francesco Monticone

High Contrast Metastructures•Mar 5, 2026•0 citations
Quantum computing is a paradigm of computing using physical systems, which operate according to quantum mechanical principles. Since 2017, functioning quantum processing units with limited capabilities are available on the cloud. There are two models of quantum computing in the literature: discrete variable and continuous variable models. The discrete variable model is an extension of the binary logic of digital computing with quantum bits |0⟩ and |1⟩ . In the continuous variable model, the quantum state space is infinite-dimensional and the quantum state is expressed with an infinite number of basis elements. In the physical implementation of quantum computing, however, the quantized energy levels of the electromagnetic field come in multiple values, naturally realizing the multi-valued logic of computing. Hence, to implement the discrete variable model (binary logic) of quantum computing, the temperature control is needed to restrict the energy levels to the lowest two to express the binary quantum states |0⟩ and |1⟩. The physical realization of the continuous variable model naturally implements the multi-valued logic of computing because any physical system always has the highest level of quantized energy observed i.e., the quantum state space is always finite dimensional. In 2001, Knill, Laflamme, and Milburn proved that linear optics realizes universal quantum computing in the qubit-based model. Optical quantum computers by Xanadu, under the phase space representation of quantum optics, naturally realizes the multi-valued logic of quantum computing at room temperature. Optical quantum computers use optical signals, which are most compatible with the fiber optics communication network. They are easily fabricable for mass production, robust to noise, and have low latency. Optical quantum computing provides flexibility to the users for determining the dimension of the computational space for each instance of computation. Additionally, nonlinear quantum optical effects are incorporated as nonlinear quantum gates. That flexibility of user-defined dimension of the computational space and availability of nonlinear gates lead to a faithful implementation of quantum neural networks in optical quantum computing. This dissertation provides a full description of a multi-class data quantum classifier on ten classes of the MNIST dataset. In this dissertation, I provide the background information of optical quantum computing as an ideal candidate material for building the future classical-quantum hybrid internet for its numerous benefits, among which the compatibility with the existing communications/computing infrastructure is a main one. I also show that optical quantum computing can be a hardware platform for realizing the multi- valued logic
Bosonic quantum systems are among the leading architectures for quantum information processing, offering continuous-variable degrees of freedom with strong error-correction capabilities. However, standard bosonic quantum computation models such as the Lloyd-Braunstein [Lloyd and Braunstein, 1999] and hybrid oscillator-qubit models [Brenner, Dias, and Koenig, 2025; Liu et al., 2026] permit dramatic energy growth, leading to unphysical computational power and the breakdown of fundamental algorithmic tools such as universal and efficient compilation [Brenner et al., 2026; Rudolph et al., 2025]. To address this, we introduce a new model of bosonic quantum computation, Bosonic Energy-Preserving Quantum Computation (BEQC), in which energy is treated as a computational resource. Namely, energy is supplied solely through input coherent states, and all gates are generated by energy-preserving Hamiltonians. Thus, by construction, dramatic energy growth is impossible, making the model physically grounded. We next show that BEQC is a computationally robust and universal model in many respects, including: (1. Computational power) BEQC efficiently simulates all polynomial-energy computations in existing models, and exactly recovers BQP in the polynomial energy setting. It further admits several complexity-theoretic upper bounds when varying the energy, precision, and space parameters of the model. (2. Universal gate sets and state synthesis) BEQC has natural universal gate sets based on linear optics and Kerr interactions. In particular, we obtain a Solovay-Kitaev theorem which circumvents previous no-go results. We give various applications, including (a) a protocol for engineering GKP states with rigorous preparation guarantees, (b) Fock state preparation to exponential precision, and (c) native Fock space simulation of any qubit-based unitary.