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:0710.3329 · Theoretical Computer Science

Universality and programmability of quantum computers

Willem L. Fouché, Johannes Heidema, Glyn Jones, Petrus H. Potgieter

Published May 19, 2008• 5 citations
arXivHTMLPDF
DOI
10.1016/j.tcs.2008.05.007

Related papers

Universality and Optimality of Programmable Quantum Processors

Mário Ziman, Vladimír Bužek

arXiv:quant-ph/0612218•Acta Physiologica Hungarica•Nov 1, 2006•3 citations

Programmable quantum processor implemented with superconducting circuit

Nian-Quan Jiang, Xi Liang, Mingfeng Wang

Abstract A quantum processor might execute certain computational tasks exponentially faster than a classical processor. Here, using superconducting quantum circuits we design a powerful universal quantum processor with the structure of symmetric all-to-all capacitive connection. We present the Hamiltonian and use it to demonstrate a full set of qubit operations needed in the programmable universal quantum computations. With the device the unwanted crosstalk and ZZ -type couplings between qubits can be effectively suppressed by tuning gate voltages, and the design allows efficient and high-quality couplings of qubits. Within available technology, the scheme may enable a practical programmable universal quantum computer.

Communications in Theoretical Physics•Feb 10, 2021•1 citation

Universality in Quantum Computation

Emmanuel Jeandel

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

Programmable Photonic Time Circuits for Highly Scalable Universal Unitaries

Xianji Piao, Sunkyu Yu, Namkyoo Park

Programmable photonic circuits (PPCs) have garnered substantial interest for their potential in facilitating deep learning accelerations and universal quantum computations. Although photonic computation using PPCs offers ultrafast operation, energy-efficient matrix calculations, and room-temperature quantum states, its poor scalability hinders integration. This challenge arises from the temporally one-shot operation of propagating light in conventional PPCs, resulting in a light-speed increase in device footprints. Here we propose the concept of programmable photonic time circuits, utilizing time-cycle-based computations analogous to gate cycling in the von Neumann architecture and quantum computation. Our building block is a reconfigurable SU(2) time gate, consisting of two resonators with tunable resonances, and coupled via time-coded dual-channel gauge fields. We demonstrate universal U(N) operations with high fidelity using an assembly of the SU(2) time gates, substantially improving scalability from O(N^{2}) to O(N) in terms of both the footprint and the number of gates. This result paves the way for PPC implementation in very large-scale integration.

arXiv:2305.17632•Physical Review Letters•Mar 5, 2024•16 citations

Irreversibility and Universality in Quantum Computation

Giuseppe Sergioli

•Jan 5, 2012•0 citations

Toward a Universal Quantum Computer

Yu Shi

Given the existence of a universal quantum Turing machine, there is no conflict in the definition of a universal quantum computer between being universal and the need for a halt qubit, as previously claimed. It is also pointed out that there exists a universal, i.e. programmable, quantum circuit which can perform an arbitrary quantum computation, by repeating the operation of a fixed gate array.

•Aug 24, 1999•0 citations
Abstract A quantum processor might execute certain computational tasks exponentially faster than a classical processor. Here, using superconducting quantum circuits we design a powerful universal quantum processor with the structure of symmetric all-to-all capacitive connection. We present the Hamiltonian and use it to demonstrate a full set of qubit operations needed in the programmable universal quantum computations. With the device the unwanted crosstalk and ZZ -type couplings between qubits can be effectively suppressed by tuning gate voltages, and the design allows efficient and high-quality couplings of qubits. Within available technology, the scheme may enable a practical programmable universal quantum computer.
Programmable photonic circuits (PPCs) have garnered substantial interest for their potential in facilitating deep learning accelerations and universal quantum computations. Although photonic computation using PPCs offers ultrafast operation, energy-efficient matrix calculations, and room-temperature quantum states, its poor scalability hinders integration. This challenge arises from the temporally one-shot operation of propagating light in conventional PPCs, resulting in a light-speed increase in device footprints. Here we propose the concept of programmable photonic time circuits, utilizing time-cycle-based computations analogous to gate cycling in the von Neumann architecture and quantum computation. Our building block is a reconfigurable SU(2) time gate, consisting of two resonators with tunable resonances, and coupled via time-coded dual-channel gauge fields. We demonstrate universal U(N) operations with high fidelity using an assembly of the SU(2) time gates, substantially improving scalability from O(N^{2}) to O(N) in terms of both the footprint and the number of gates. This result paves the way for PPC implementation in very large-scale integration.