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/0612218 · Acta Physiologica Hungarica

Universality and Optimality of Programmable Quantum Processors

Mário Ziman, Vladimír Bužek

Published Nov 1, 2006• 3 citations
arXivHTMLPDF
DOI
10.1556/aph.26.2006.3-4.8

Related papers

Programmable Quantum Processors

Vladimír Bužek, Mark S. Hillery, Mário Ziman +1 more

Quantum Information Processing•Jul 11, 2006•13 citations

Realization of a programmable two-qubit quantum processor

David Hanneke, Jonathan Home, John D. Jost +3 more

arXiv:0908.3031•Nature Physics•Nov 15, 2009•151 citations

Equivalent programmable quantum processors

Mark S. Hillery, Vladimír Bužek, Mário Ziman

Optics Communications•Nov 12, 2009•1 citation

Universality and programmability of quantum computers

Willem L. Fouché, Johannes Heidema, Glyn Jones +1 more

arXiv:0710.3329•Theoretical Computer Science•May 19, 2008•5 citations

Port-Based State Preparation and Applications

Garazi Muguruza, Florian Speelman

We introduce Port-Based State Preparation (PBSP), a teleportation task where Alice holds a complete classical description of the target state and Bob's correction operations are restricted to only tracing out registers. We show a protocol that implements PBSP with error decreasing exponentially in the number of ports, in contrast to the polynomial trade-off for the related task of Port-Based Teleportation, and we prove that this is optimal when a maximally entangled resource state is used. As an application, we introduce approximate Universal Programmable Hybrid Processors (UPHP). Here the goal is to encode a unitary as a quantum state, and the UPHP can apply this unitary to a quantum state when knowing its classical description. We give a construction that needs strictly less memory in terms of dimension than the optimal approximate Universal Programmable Quantum Processor achieving the same error. Additionally, we provide lower bounds for the optimal trade-off between memory and error of UPHPs.

arXiv:2402.18356•Quantum•Dec 18, 2024•5 citations

Asymptotic Teleportation Scheme as a Universal Programmable Quantum Processor

Satoshi Ishizaka, Tohya Hiroshima

We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable processor.

arXiv:0807.4568•Physical Review Letters•Dec 12, 2008•170 citations
We introduce Port-Based State Preparation (PBSP), a teleportation task where Alice holds a complete classical description of the target state and Bob's correction operations are restricted to only tracing out registers. We show a protocol that implements PBSP with error decreasing exponentially in the number of ports, in contrast to the polynomial trade-off for the related task of Port-Based Teleportation, and we prove that this is optimal when a maximally entangled resource state is used. As an application, we introduce approximate Universal Programmable Hybrid Processors (UPHP). Here the goal is to encode a unitary as a quantum state, and the UPHP can apply this unitary to a quantum state when knowing its classical description. We give a construction that needs strictly less memory in terms of dimension than the optimal approximate Universal Programmable Quantum Processor achieving the same error. Additionally, we provide lower bounds for the optimal trade-off between memory and error of UPHPs.
We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable processor.