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

Nature Physics

In search of lost memories

Mark Buchanan

Published May 1, 2019• 0 citations
Publisher
DOI
10.1038/s41567-019-0521-9

Related papers

Optimized Quantum Autoencoder

Yibin Huang, Muchun Yang, D. L. Zhou

Abstract Quantum autoencoder (QAE) compresses a bipartite quantum state into its subsystem using a self-checking mechanism. How to characterize and minimize the lost information in this process is essential for understanding the compression mechanism of QAE. Here, we investigate how to minimize the lost information in QAE for any input mixed state. We theoretically show that the lost information is the quantum mutual information between the remaining subsystem and the discarded one; the encoding unitary transformation is designed to minimize this mutual information. Furthermore, we show that the optimized unitary transformation can be decomposed as the product of a permutation unitary transformation and a disentanglement unitary transformation, and the permutation unitary transformation can be searched by a regular Young tableau algorithm. When the search can be made exhaustive in lower-dimensional systems, the lost information is minimized numerically, which is shown theoretically to be a global minimum. When the dimension of the system becomes larger such that an exhaustive search is impossible, we adopt an approximate search algorithm to numerically identify that our compression scheme gives lower lost information than that from the quantum variational circuit-based QAE.

arXiv:2404.08429•Chinese Physics Letters•Jan 5, 2026•3 citations

In Search of Reality

Bernard d’Espagnat

Springer eBooks•Jan 1, 1983•103 citations

Fault-ignorant quantum search

Péter Vrana, David Reeb, Daniel Reitzner +1 more

We investigate the problem of quantum searching on a noisy quantum computer. Taking a fault-ignorant approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand. We prove lower bounds on the runtime of such algorithms and thereby find that the quadratic speedup is necessarily lost (in our noise models). However, for low but constant noise levels the algorithms we provide (based on Groverʼs algorithm) still outperform the best noiseless classical search algorithm.

arXiv:1307.0771•New Journal of Physics•Jul 24, 2014•14 citations

THE QUEST FOR THE HIDDEN REALITY

WORLD SCIENTIFIC (EUROPE) eBooks•Oct 1, 2024•0 citations

Scattering quantum random-walk search with errors

A. Gábris, T. Kiss, Igor Jex

We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behavior that asymptotically tends to a nonzero value.

arXiv:quant-ph/0701150•Physical Review A•Dec 20, 2007•21 citations

A future without long memories?

Nicolas Sangouard

Nature Photonics•Nov 1, 2012•3 citations
Abstract Quantum autoencoder (QAE) compresses a bipartite quantum state into its subsystem using a self-checking mechanism. How to characterize and minimize the lost information in this process is essential for understanding the compression mechanism of QAE. Here, we investigate how to minimize the lost information in QAE for any input mixed state. We theoretically show that the lost information is the quantum mutual information between the remaining subsystem and the discarded one; the encoding unitary transformation is designed to minimize this mutual information. Furthermore, we show that the optimized unitary transformation can be decomposed as the product of a permutation unitary transformation and a disentanglement unitary transformation, and the permutation unitary transformation can be searched by a regular Young tableau algorithm. When the search can be made exhaustive in lower-dimensional systems, the lost information is minimized numerically, which is shown theoretically to be a global minimum. When the dimension of the system becomes larger such that an exhaustive search is impossible, we adopt an approximate search algorithm to numerically identify that our compression scheme gives lower lost information than that from the quantum variational circuit-based QAE.
We investigate the problem of quantum searching on a noisy quantum computer. Taking a fault-ignorant approach, we analyze quantum algorithms that solve the task for various different noise strengths, which are possibly unknown beforehand. We prove lower bounds on the runtime of such algorithms and thereby find that the quadratic speedup is necessarily lost (in our noise models). However, for low but constant noise levels the algorithms we provide (based on Groverʼs algorithm) still outperform the best noiseless classical search algorithm.
We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behavior that asymptotically tends to a nonzero value.