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

Soviet Journal of Quantum Electronics

High-capacity holographic memories with synthesized aperture

В Н Морозов, Yurii M Popov

Published Nov 30, 1976• 2 citations
Publisher

Abstract

An analysis is made of a method for increasing the capacity of holographic memories. The method is based on the use of aperture synthesis principles and makes possible the increase of the memory capacity by ~ 104.
DOI
10.1070/qe1976v006n11abeh012001

Related papers

Optimization of holographic memories

Nikolai A. Kostrov

An analysis is made of the influence of a change in the diameter of the reconstructing beam and of its displacement relative to the center of a hologram on the signal/noise ratio of a holographic memory. The optimal ratio of the diameters of the hologram and reconstructing beam, corresponding to the maximum signal reaching the photodetector, is estimated.

Soviet Journal of Quantum Electronics•Oct 31, 1975•0 citations

Information capacity of a hologram memory recorded and reconstructed using radiation of different wavelengths

M A Maĭorchuk, V D Samoilov

It is shown that the recording and reconstruction of holograms with coherent emitting different wavelengths results in an additional restriction on the information capacity of a holographic memory. The optimal parameters, corresponding to the maximum capacity of such a memory, are deduced.

Soviet Journal of Quantum Electronics•Mar 31, 1974•0 citations

Holographic memory device for tuning homogeneous media

G A Mirzoyan, Anton A. Vasilev, Igor N. Kompanets +1 more

A holographic memory was constructed and used to store microprograms for tuning a homogeneous medium operating in conjunction with a digital computer. Holograms were recorded using a controlled transparency which made it possible to form optical tuning patterns and to project them directly onto a photodetector array of the homogeneous medium.

Soviet Journal of Quantum Electronics•May 31, 1974•0 citations

Towards highly multimode optical quantum memory for quantum repeaters

Pierre Jobez, Nuala Timoney, Cyril Laplane +5 more

A technique to increase the capacity of a quantum memory is demonstrated. The method is based on shaping the profile of an optical pumping pulse, thus creating a high-resolution atomic comb structure that acts as a time-multiplexing optical storage device.

arXiv:1512.02936•Physical Review A•Mar 21, 2016•131 citations

Bi-Direction Synthesis for Reversible Circuits

Guowu Yang, Xiaoyu Song, William N. N. Hung +1 more

Quantum computing is one of the most promising emerging technologies of the future. Reversible circuits are an important class of quantum circuits. In this paper, we investigate the problem of optimally synthesizing four-qubit reversible circuits. We present an enhanced bidirectional synthesis approach. Due to the super-exponential increase on the memory requirement, all the existing methods can only perform four steps for the CNP (Control-Not gate, NOT gate, and Peres gate) library. Our novel method can achieve 12 steps. As a result, we augment the number of circuits that can be optimally synthesized by over 5/sup */10/sup 6/ times. Moreover, our approach is faster than the existing approaches by orders of magnitude. The promising experimental results demonstrate the effectiveness of our approach.

IEEE Computer Society Annual Symposium on VLSI•May 24, 2005•14 citations

Synthesis and Optimization of Encoding Circuits for Fault-Tolerant Quantum Computation

Tom Peham, Matthew Steinberg, Robert Wille +1 more

Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of efficient general-state encoding circuits an important problem, particularly with respect to two-qubit gate count and circuit depth. Yet the synthesis of such encoders has been studied less extensively than general Clifford circuit synthesis or the preparation of specific logical Pauli-eigenstates. In this work, we develop methods for synthesizing efficient encoders for arbitrary stabilizer codes. We formulate encoder synthesis as a search over stabilizer tableaus and introduce greedy and rollout-based algorithms that exploit the freedom among stabilizer-equivalent realizations of the same encoding isometry. For code families with a modular structure, such as generalized concatenated and holographic codes, we show how large encoders can be assembled from optimized local constituent encoders, and we use SMT-based exact synthesis to obtain optimal local circuits for small instances. We further evaluate the proposed methods on a broad set of stabilizer codes, including holographic and quantum low-density parity-check (qLDPC) codes, and compare them against recent encoder-synthesis methods and existing constructions from the literature, obtaining improvements of up to 43% in two-qubit gate count and up to 70% in depth. Our results support the optimization of encoded-state preparation in several fault-tolerant quantum-computing schemes, and all methods are openly available as part of the Munich Quantum Toolkit.

quant-pharXiv:2605.15266•May 18, 2026•1 citation
Quantum computing is one of the most promising emerging technologies of the future. Reversible circuits are an important class of quantum circuits. In this paper, we investigate the problem of optimally synthesizing four-qubit reversible circuits. We present an enhanced bidirectional synthesis approach. Due to the super-exponential increase on the memory requirement, all the existing methods can only perform four steps for the CNP (Control-Not gate, NOT gate, and Peres gate) library. Our novel method can achieve 12 steps. As a result, we augment the number of circuits that can be optimally synthesized by over 5/sup */10/sup 6/ times. Moreover, our approach is faster than the existing approaches by orders of magnitude. The promising experimental results demonstrate the effectiveness of our approach.
Preparing arbitrary logical states is a central primitive for universal fault-tolerant quantum computation and the cost of encoded-state preparation contributes directly to the overall resource overhead. This makes the synthesis of efficient general-state encoding circuits an important problem, particularly with respect to two-qubit gate count and circuit depth. Yet the synthesis of such encoders has been studied less extensively than general Clifford circuit synthesis or the preparation of specific logical Pauli-eigenstates. In this work, we develop methods for synthesizing efficient encoders for arbitrary stabilizer codes. We formulate encoder synthesis as a search over stabilizer tableaus and introduce greedy and rollout-based algorithms that exploit the freedom among stabilizer-equivalent realizations of the same encoding isometry. For code families with a modular structure, such as generalized concatenated and holographic codes, we show how large encoders can be assembled from optimized local constituent encoders, and we use SMT-based exact synthesis to obtain optimal local circuits for small instances. We further evaluate the proposed methods on a broad set of stabilizer codes, including holographic and quantum low-density parity-check (qLDPC) codes, and compare them against recent encoder-synthesis methods and existing constructions from the literature, obtaining improvements of up to 43% in two-qubit gate count and up to 70% in depth. Our results support the optimization of encoded-state preparation in several fault-tolerant quantum-computing schemes, and all methods are openly available as part of the Munich Quantum Toolkit.