Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum vs. Symplectic Computers (2407.12755v1)

Published 17 Jul 2024 in quant-ph and hep-th

Abstract: In this paper, we propose the concept of symplectic computers, which have the potential to be more powerful than quantum computers. Unlike quantum computing, which consists of a sequence of unitary transformations (gates) and projectors (measurements), symplectic computation involves a sequence of symplectic transformations and measurements. The proposal to explore symplectic computers is based on the following quantum-symplectic duality. The Schr\"odinger equation in its standard complex form describes the unitary evolution of a quantum system, while its real form describes the symplectic evolution of a classical mechanical system. This quantum-symplectic duality can be leveraged to enhance the capabilities of quantum and symplectic computers. In this symplectic approach, the role of a quantum bit (qubit) is taken by a symplectic bit (symbit).

Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com