Researcher-in-the-Loop Evolutionary Discovery of Entanglement-Assisted Quantum Code Families

Classés selon la proximité de leur titre et de leur résumé avec ceux de cet article. Sélectionnez-en pour les lire ensemble.

Les articles les plus proches

1. Proche Autre approche du problème Pas pertinent

   Quantum Error Correction via Noise Guessing Decoding

   Diogo Cruz, Francisco A. Monteiro, Bruno C. Coutinho · 2022 · Quantum Physics · cité 23 fois · Résumé IA disponible

   Quantum Error Correction via Noise Guessing Decoding construit et décode des codes quantiques pour optimiser les performances à longueur finie, tandis que l’article établit une famille EAQECC.

   Résumé scientifique

   Quantum error correction codes (QECCs) play a central role both in quantum communications and in quantum computation, given how error-prone quantum technologies are. Practical quantum error correction codes, such as stabilizer codes, are generally structured to suit a specific use, and present rigid code lengths and code rates, limiting their adaptability to changing requirements. This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime, for any chosen code length and when the code rate is sufficiently high. A recently proposed strategy for decoding classical codes called GRAND (guessing random additive n…

2. Proche Contexte plus large Pas pertinent

   Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation

   Hirofumi Nishi, Taichi Kosugi, Yu-ichiro Matsushita · 2020 · npj Quantum Inf 7, 85 (2021) · cité 103 fois · Résumé IA disponible

   Implementation of quantum imaginary-time evolution method on NISQ devices: Nonlocal approximation réduit la profondeur des circuits QITE, sans étudier la construction de codes correcteurs.

   Résumé scientifique

   The imaginary-time evolution method is widely known to be efficient for obtaining the ground state in quantum many-body problems on a classical computer. A recently proposed quantum imaginary-time evolution method (QITE) faces problems of deep circuit depth and difficulty in the implementation on noisy intermediate-scale quantum (NISQ) devices. In this study, a nonlocal approximation is developed to tackle this difficulty. We found that by removing the locality condition or local approximation (LA), which was imposed when the imaginary-time evolution operator is converted to a unitary operator, the quantum circuit depth is significantly reduced. We propose two-step approximation methods base…

3. Proche Contexte plus large Pas pertinent

   Logical Error Rates for a [[4,2,2]]-Encoded Variational Quantum Eigensolver Ansatz

   Meenambika Gowrishankar, Daniel Claudino, Jerimiah Wright et al. · 2024 · Quantum Physics · cité 9 fois · Pas encore résumé

   Logical Error Rates for a [[4,2,2]]-Encoded Variational Quantum Eigensolver Ansatz mesure l’effet d’un code de détection sur une application VQE, plutôt que de découvrir une famille de codes.

   Résumé scientifique

   Application benchmarks that run on noisy, intermediate-scale quantum (NISQ) computing devices require techniques for mitigating errors to improve accuracy and precision. Quantum error detection codes offer a framework by which to encode quantum computations and identify when errors occur. However, the subsequent logical error rate depends on the encoded application circuit as well as the underlying noise. Here, we quantify how the [[4,2,2]] quantum error detection code improves the logical error rate, accuracy, and precision of an encoded variational quantum eigensolver (VQE) application. We benchmark the performance of the encoded VQE for estimating the energy of the hydrogen molecule with …

4. Proche Même méthode, autre problème Pas pertinent

   Code Evolution Graphs: Understanding Large Language Model Driven Design of Algorithms

   Niki van Stein, Anna V. Kononova, Lars Kotthoff et al. · 2025 · Neural and Evolutionary Computing · cité 21 fois · Résumé IA disponible

   Code Evolution Graphs analyse l’évolution de programmes générés par LLM pour concevoir des algorithmes, comme l’évolution de programmes employée ici pour découvrir des codes.

   Résumé scientifique

   Large Language Models (LLMs) have demonstrated great promise in generating code, especially when used inside an evolutionary computation framework to iteratively optimize the generated algorithms. However, in some cases they fail to generate competitive algorithms or the code optimization stalls, and we are left with no recourse because of a lack of understanding of the generation process and generated codes. We present a novel approach to mitigate this problem by enabling users to analyze the generated codes inside the evolutionary process and how they evolve over repeated prompting of the LLM. We show results for three benchmark problem classes and demonstrate novel insights. In particular…

5. Proche Contexte plus large Pas pertinent

   Bridging Entanglement and Magic Resources through Operator Space

   Neil Dowling, Kavan Modi, Gregory A. L. White · 2025 · Quantum Physics · cité 35 fois · Résumé IA disponible

   Bridging Entanglement and Magic Resources through Operator Space relie l’intrication des opérateurs aux ressources de magie, un sujet distinct des codes EAQECC étudiés ici.

   Résumé scientifique

   Local operator entanglement (LOE) dictates the complexity of simulating Heisenberg evolution using tensor network methods, and serves as strong dynamical signature of quantum chaos. We show that LOE is also sensitive to how non-Clifford a unitary is: its magic resources. In particular, we prove that LOE is always upper-bound by three distinct magic monotones: $T$-count, unitary nullity, and operator stabilizer Rényi entropy. Moreover, in the average case for large, random circuits, LOE and magic monotones approximately coincide. Our results imply that an operator evolution that is expensive to simulate using tensor network methods must also be inefficient using both stabilizer and Pauli trun…

6. Proche Contexte plus large Pas pertinent

   Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution

   Mario Motta, Chong Sun, Adrian Teck Keng Tan et al. · 2019 · Nature Physics 16, 205-210 (2020) · cité 866 fois · Résumé IA disponible

   Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution propose une méthode d’évolution en temps imaginaire, sans traiter les codes correcteurs.

   Résumé scientifique

   The accurate computation of Hamiltonian ground, excited, and thermal states on quantum computers stands to impact many problems in the physical and computer sciences, from quantum simulation to machine learning. Given the challenges posed in constructing large-scale quantum computers, these tasks should be carried out in a resource-efficient way. In this regard, existing techniques based on phase estimation or variational algorithms display potential disadvantages; phase estimation requires deep circuits with ancillae, that are hard to execute reliably without error correction, while variational algorithms, while flexible with respect to circuit depth, entail additional high-dimensional clas…

7. Proche Contexte plus large Pas pertinent

   Quantum eigenvalue processing

   Guang Hao Low, Yuan Su · 2024 · Quantum Physics · cité 60 fois · Résumé IA disponible

   Quantum eigenvalue processing présente des transformations et estimations de valeurs propres pour opérateurs non normaux, sans lien direct avec la découverte de familles de codes.

   Résumé scientifique

   Many problems in linear algebra -- such as those arising from non-Hermitian physics and differential equations -- can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. However, the existing Quantum Singular Value Transformation (QSVT) framework is ill-suited to this task, as eigenvalues and singular values are different in general. We present a Quantum EigenValue Transformation (QEVT) framework for applying arbitrary polynomial transformations on eigenvalues of block-encoded non-normal operators, and a related Quantum EigenValue Estimation (QEVE) algorithm for operators with real spectra. QEVT has query complexity to the block encoding nearly recover…

8. Proche Contexte plus large Pas pertinent

   Benchmarking highly entangled states on a 60-atom analog quantum simulator

   Adam L. Shaw, Zhuo Chen, Joonhee Choi et al. · 2023 · Quantum Physics · cité 107 fois · Résumé IA disponible

   Benchmarking highly entangled states on a 60-atom analog quantum simulator estime l’intrication d’états sur un simulateur analogique, plutôt que de construire des codes quantiques.

   Résumé scientifique

   Quantum systems have entered a competitive regime where classical computers must make approximations to represent highly entangled quantum states. However, in this beyond-classically-exact regime, fidelity comparisons between quantum and classical systems have so far been limited to digital quantum devices, and it remains unsolved how to estimate the actual entanglement content of experiments. Here we perform fidelity benchmarking and mixed-state entanglement estimation with a 60-atom analog Rydberg quantum simulator, reaching a high entanglement entropy regime where exact classical simulation becomes impractical. Our benchmarking protocol involves extrapolation from comparisons against many…