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

arXiv:1702.06410

Optical parallel computation similar to quantum computation based on optical fields modulated with pseudorandom phase sequences

Jian Bo Fu

Published Feb 17, 2017• 1 citation
arXivHTMLPDF

Abstract

We propose an optical parallel computation similar to quantum computation that can be realized by introducing pseudorandom phase sequences into classical optical fields with two orthogonal modes. Based on the pseudorandom phase sequences, we first propose a theoretical framework of "phase ensemble model" referring from the concept of quantum ensemble. Using the ensemble model, we further demonstrate the inseparability of the fields similar to quantum entanglement. It is interesting that a N2^N dimensional Hilbert space spanned by N optical fields is larger than that spanned by N quantum particles. This leads a problem for our scheme that is not the lack of resources but the redundancy of resources. In order to reduce the redundancy, we propose a special sequence permutation mechanism to efficiently imitate certain quantum states, including the product state, Bell states, GHZ state and W state. For better fault tolerance, we further devise each orthogonal mode of optical fields is measured to assign discrete values. Finally, we propose a generalized gate array model to imitate some quantum algorithms, such as Shor's algorithm, Grover's algorithm and quantum Fourier algorithm. The research on the optical parallel computation might be important, for it not only has the potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics.

DOI
10.48550/arxiv.1702.06410

Related papers

Optical analogy to quantum computation based on classical fields modulated pseudorandom phase sequences

Jian Bo Fu, Xutai Ma, Wenjiang Li +1 more

We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss efficient simulation of several typical quantum states, including product state, Bell states, GHZ state, and W state. By performing quadrature demodulation scheme, we propose a sequence permutation mechanism to simulate certain quantum states and a generalized gate array model to simulate quantum algorithm, such as Shor's algorithm and Grover's algorithm. The research on classical simulation of quantum states is important, for it not only enables potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics.

arXiv:1505.00555•May 4, 2015•3 citations

Beyond Quantum Computation Based on Classical Entanglement

Jian Bo Fu, Xutai Ma, Wenjiang Li +1 more

We demonstrate that a tensor product structure and classical entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical entanglement, we discuss efficient simulation of several typical quantum states, including product state, Bell states, GHZ state, and W state. By performing quadrature demodulation scheme, we propose a sequence permutation mechanism to simulate certain quantum states and a generalized gate array model to simulate quantum algorithm, such as Shor’s algorithm and Grover’s algorithm. The research on classical simulation of quantum states is important, for it not only enables potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics. ∗Electronic address: jianfu@zju.edu.cn 1 ar X iv :1 50 5. 00 55 5v 3 [ qu an tph ] 6 M ay 2 01 6

•May 4, 2015•0 citations

Effective Simulation of Quantum Entanglement Based on A Single-photon Field Modulated with Pseudorandom Phase Sequences

Jian Bo Fu, Yi Hu, Shuo Sun

We demonstrate that a single-photon field modulated with n different pseudorandom phase sequences (PPSs) can constitute a 2^n-dimensional Hilbert space that contains tensor product structure. By using the single photon field modulated with PPSs, we discuss effective simulation of Bell states and GHZ state, and apply both correlation analysis and von Neumann entropy to characterize the simulation. We obtain similar results with the cases in quantum mechanics and find that the conclusions can be easily generalized to n quantum particles. The research on simulation of quantum entanglement may be important, for it not only provides useful insights into fundamental features of quantum entanglement, but also yields new insights into quantum computation.

arXiv:1003.1435•Mar 7, 2010•1 citation

Optical analogy to quantum Fourier transform based on pseudorandom phase ensemble

Jian Bo Fu, Wei Fang, Yongzheng Ye

In this paper, we introduce an optical analogy to quantum Fourier tanformation based on a pseudorandom phase ensemble. The optical analogy also brings about exponential speedup over classical Fourier tanformation. Using the analogy, we demonstrate three classcial fields to realize Fourier transform similar to three quantum particles.

arXiv:1607.08308•Jul 28, 2016•1 citation

Parallel quantum computing in a single ensemble quantum computer

Gui Lu Long, Xiao Li

We propose a parallel quantum computing mode for ensemble quantum computer. In this mode, some qubits are in pure states while other qubits are in mixed states. It enables a single ensemble quantum computer to perform ``single-instruction-multidata'' type of parallel computation. Parallel quantum computing can provide additional speedup in Grover's algorithm and Shor's algorithm. In addition, it also makes a fuller use of qubit resources in an ensemble quantum computer. As a result, some qubits discarded in the preparation of an effective pure state in the Schulman-Varizani and the Cleve-DiVincenzo algorithms can be reutilized.

arXiv:quant-ph/0307055•Physical Review A•May 6, 2004•78 citations

Quantum Entanglement Encoding: A Novel Computational Logic

Jincheng Zhang

This paper proposes a novel approach to computation by leveraging quantum entanglement as a fundamental computational logic, rather than solely as a means of data transmission. We introduce a framework for constructing parallel computation architectures based on entangled states, aiming to achieve exponential speedups compared to classical computation. The core of this approach lies in designing quantum gate circuits that exploit entanglement to perform parallel data processing and logical operations. A significant portion of this work focuses on the critical challenges of maintaining and controlling entanglement over extended periods, which is paramount for the feasibility of this paradigm. We explore theoretical models and design considerations for these entangled gate circuits, examining the inherent parallelism and potential for complex computations. The underlying mathematical framework utilizes concepts from quantum information theory, including qubit states, unitary transformations, and entanglement measures. We define key operational concepts such as entanglement fidelity, concurrence, and partial transposition. The proposed system is inherently probabilistic, and we address the challenges of error mitigation and fault tolerance. This research lays the groundwork for a fundamentally different approach to computation, potentially revolutionizing fields reliant on intensive computation, such as drug discovery, materials science, and artificial intelligence.

•Aug 31, 2026•0 citations
We propose an optical parallel computation similar to quantum computation that can be realized by introducing pseudorandom phase sequences into classical optical fields with two orthogonal modes. Based on the pseudorandom phase sequences, we first propose a theoretical framework of "phase ensemble model" referring from the concept of quantum ensemble. Using the ensemble model, we further demonstrate the inseparability of the fields similar to quantum entanglement. It is interesting that a N2^N dimensional Hilbert space spanned by N optical fields is larger than that spanned by N quantum particles. This leads a problem for our scheme that is not the lack of resources but the redundancy of resources. In order to reduce the redundancy, we propose a special sequence permutation mechanism to efficiently imitate certain quantum states, including the product state, Bell states, GHZ state and W state. For better fault tolerance, we further devise each orthogonal mode of optical fields is measured to assign discrete values. Finally, we propose a generalized gate array model to imitate some quantum algorithms, such as Shor's algorithm, Grover's algorithm and quantum Fourier algorithm. The research on the optical parallel computation might be important, for it not only has the potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics.
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss efficient simulation of several typical quantum states, including product state, Bell states, GHZ state, and W state. By performing quadrature demodulation scheme, we propose a sequence permutation mechanism to simulate certain quantum states and a generalized gate array model to simulate quantum algorithm, such as Shor's algorithm and Grover's algorithm. The research on classical simulation of quantum states is important, for it not only enables potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics.
We demonstrate that a tensor product structure and classical entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical entanglement, we discuss efficient simulation of several typical quantum states, including product state, Bell states, GHZ state, and W state. By performing quadrature demodulation scheme, we propose a sequence permutation mechanism to simulate certain quantum states and a generalized gate array model to simulate quantum algorithm, such as Shor’s algorithm and Grover’s algorithm. The research on classical simulation of quantum states is important, for it not only enables potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics. ∗Electronic address: jianfu@zju.edu.cn 1 ar X iv :1 50 5. 00 55 5v 3 [ qu an tph ] 6 M ay 2 01 6
We demonstrate that a single-photon field modulated with n different pseudorandom phase sequences (PPSs) can constitute a 2^n-dimensional Hilbert space that contains tensor product structure. By using the single photon field modulated with PPSs, we discuss effective simulation of Bell states and GHZ state, and apply both correlation analysis and von Neumann entropy to characterize the simulation. We obtain similar results with the cases in quantum mechanics and find that the conclusions can be easily generalized to n quantum particles. The research on simulation of quantum entanglement may be important, for it not only provides useful insights into fundamental features of quantum entanglement, but also yields new insights into quantum computation.
We propose a parallel quantum computing mode for ensemble quantum computer. In this mode, some qubits are in pure states while other qubits are in mixed states. It enables a single ensemble quantum computer to perform ``single-instruction-multidata'' type of parallel computation. Parallel quantum computing can provide additional speedup in Grover's algorithm and Shor's algorithm. In addition, it also makes a fuller use of qubit resources in an ensemble quantum computer. As a result, some qubits discarded in the preparation of an effective pure state in the Schulman-Varizani and the Cleve-DiVincenzo algorithms can be reutilized.
This paper proposes a novel approach to computation by leveraging quantum entanglement as a fundamental computational logic, rather than solely as a means of data transmission. We introduce a framework for constructing parallel computation architectures based on entangled states, aiming to achieve exponential speedups compared to classical computation. The core of this approach lies in designing quantum gate circuits that exploit entanglement to perform parallel data processing and logical operations. A significant portion of this work focuses on the critical challenges of maintaining and controlling entanglement over extended periods, which is paramount for the feasibility of this paradigm. We explore theoretical models and design considerations for these entangled gate circuits, examining the inherent parallelism and potential for complex computations. The underlying mathematical framework utilizes concepts from quantum information theory, including qubit states, unitary transformations, and entanglement measures. We define key operational concepts such as entanglement fidelity, concurrence, and partial transposition. The proposed system is inherently probabilistic, and we address the challenges of error mitigation and fault tolerance. This research lays the groundwork for a fundamentally different approach to computation, potentially revolutionizing fields reliant on intensive computation, such as drug discovery, materials science, and artificial intelligence.