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

Lecture notes in computer science

Holographic Algorithms: The Power of Dimensionality Resolved

Jin‐Yi Cai, Pinyan Lu

Published Aug 25, 2007• 16 citations
Publisher
DOI
10.1007/978-3-540-73420-8_55

Related papers

Holographic algorithms: The power of dimensionality resolved

Jin‐Yi Cai, Pinyan Lu

Theoretical Computer Science•Jan 5, 2009•28 citations

Base collapse of holographic algorithms

Mingji Xia

A holographic algorithm solves a problem in a domain of size n, by reducing it to counting perfect matchings in planar graphs. It may simulate a n-value variable by a bunch of t matchgate bits, which has 2t values. The transformation in the simulation can be expressed as a n × 2t matrix M, called the base of the holographic algorithm. We wonder whether more matchgate bits bring us more powerful holographic algorithms. In another word, whether we can solve the same original problem, with a collapsed base of size n × 2r, where r<t.

arXiv:1511.01230•ACM Symposium on Theory of Computing (STOC)•Jun 10, 2016•6 citations

Holographic algorithms: From art to science

Jin‐Yi Cai, Pinyan Lu

Journal of Computer and System Sciences•Jun 12, 2010•81 citations

Holographic algorithms

István Miklós

Chapman & Hall/CRC eBooks•Feb 21, 2019•0 citations

Quantum Holographic Teleportation of Light Fields

I. V. Sokolov, Mikhail I. Kolobov, A. Gatti +1 more

We describe a continious variable teleportation scheme that allows to teleport the quantum state of distributed in space-time multimode electromagnetic field. Our teleportation protocol uses the spatially-multimode entangled Einstein-Podolsky-Rosen lihgt beams. We evaluate the "resolving power" of teleportation in space-time and specify the degrees of freedom of electromagnetic field whose quantum state can be effectively teleported. We call this scheme "quantum holographic teleportation" because it can be considered as an extension of conventional holography to quantum domain.

arXiv:quant-ph/0007026•Jul 10, 2000•4 citations

Some observations on holographic algorithms

Leslie Gabriel Valiant

Computational Complexity•Aug 29, 2017•5 citations
A holographic algorithm solves a problem in a domain of size n, by reducing it to counting perfect matchings in planar graphs. It may simulate a n-value variable by a bunch of t matchgate bits, which has 2t values. The transformation in the simulation can be expressed as a n × 2t matrix M, called the base of the holographic algorithm. We wonder whether more matchgate bits bring us more powerful holographic algorithms. In another word, whether we can solve the same original problem, with a collapsed base of size n × 2r, where r<t.
We describe a continious variable teleportation scheme that allows to teleport the quantum state of distributed in space-time multimode electromagnetic field. Our teleportation protocol uses the spatially-multimode entangled Einstein-Podolsky-Rosen lihgt beams. We evaluate the "resolving power" of teleportation in space-time and specify the degrees of freedom of electromagnetic field whose quantum state can be effectively teleported. We call this scheme "quantum holographic teleportation" because it can be considered as an extension of conventional holography to quantum domain.