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:quant-ph/9908074 · Physics Letters A

Remarks on universal quantum computer

Yu Shi

Published Feb 1, 2002• 34 citations
arXivHTMLPDF
DOI
10.1016/s0375-9601(02)00015-4

Related papers

Remarks on Universal Quantum Computer

Yu Shi

This paper has been superseded by quant-ph/9908074.

arXiv:quant-ph/9805083•May 28, 1998•0 citations

Universal Quantum Computation

Junya Kasahara

•Jan 1, 2019•1 citation

Quantum computing with analog circuits: Hilbert space computing

László B. Kish

We first point out the practical difficulties of universal quantum computing which may prohibit practical applications as universal computers. Then we show how to apply analog microelectronic circuits to realize the architecture, data processing and parallel computing abilities of quantum computing via Hilbert space computing with analog circuits. Such a Hilbert-space-analog (HSA) computer simulates the Hilbert space and its operators and it is able to use and test quantum algorithms developed for the real quantum computers. Such a computer would be free of most of the practical difficulties of realizing and running a real quantum computer. This computer can be made universal. It is remarkable that by using the same numbers of transistors as in today's PCs, such a HSA computer can manipulate ~107 analog numbers corresponding to ~23 qubits, simultaneously, by quantum-parallel processing.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 24, 2003•13 citations

Universality in Quantum Computation

Emmanuel Jeandel

Lecture notes in computer science•Jan 1, 2004•6 citations

Universal Quantum Computing

Richard L. Amoroso

WORLD SCIENTIFIC eBooks•Jul 10, 2016•7 citations

Demonstration of quantum permutation algorithm with a single photon ququart

Pei Zhang, Feiran Wang, Yunlong Wang +2 more

We report an experiment to demonstrate a quantum permutation determining algorithm by employing photon polarization and spatial modes. This work displays the remarkable speedup of quantum algorithm and strong universality in quantum computation.

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)•Aug 1, 2015•1 citation
We first point out the practical difficulties of universal quantum computing which may prohibit practical applications as universal computers. Then we show how to apply analog microelectronic circuits to realize the architecture, data processing and parallel computing abilities of quantum computing via Hilbert space computing with analog circuits. Such a Hilbert-space-analog (HSA) computer simulates the Hilbert space and its operators and it is able to use and test quantum algorithms developed for the real quantum computers. Such a computer would be free of most of the practical difficulties of realizing and running a real quantum computer. This computer can be made universal. It is remarkable that by using the same numbers of transistors as in today's PCs, such a HSA computer can manipulate ~107 analog numbers corresponding to ~23 qubits, simultaneously, by quantum-parallel processing.