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

Replication Package for Reducing Measurement Settings for Fermionic Quantum Simulators Using Combinatorial Testing Techniques

Adrián Marín Boyero, Malte Lochau, Otfried Gühne, Chau Nguyen, Mathis Weiß, Kiara Hansenne, Bebeto Arold Ateumo, Carlos Augusto Belini de Gois, Soroor Eskandari Khorram Abadi, Aroosa Batool

Published Nov 3, 2026• 0 citations
Publisher

Abstract

Replication Package for Reducing Measurement Settings for Fermionic Quantum Simulators Using Combinatorial Testing Techniques
DOI
10.6084/m9.figshare.34898856

Related papers

Enabling Computation of Correlation Bounds for Finite-Dimensional Quantum Systems via Symmetrization

Armin Tavakoli, Denis Rosset, Marc-Olivier Renou

We present a technique for reducing the computational requirements by several orders of magnitude in the evaluation of semidefinite relaxations for bounding the set of quantum correlations arising from finite-dimensional Hilbert spaces. The technique, which we make publicly available through a user-friendly software package, relies on the exploitation of symmetries present in the optimization problem to reduce the number of variables and the block sizes in semidefinite relaxations. It is widely applicable in problems encountered in quantum information theory and enables computations that were previously too demanding. We demonstrate its advantages and general applicability in several physical problems. In particular, we use it to robustly certify the nonprojectiveness of high-dimensional measurements in a black-box scenario based on self-tests of d-dimensional symmetric informationally complete positive-operator-valued measurements.

arXiv:1808.02412•Physical Review Letters•Feb 20, 2019•63 citations

Quantum Simulation and Emulation Techniques

Keshav Kumar, Man Mohan Shukla

Springer eBooks•Jan 1, 2026•0 citations

Making fermionic quantum simulators more affordable

Daniel Leykam

•Aug 17, 2021•0 citations

Fermionic Reduced Density Low-Rank Matrix Completion, Noise Filtering, and Measurement Reduction in Quantum Simulations

Linqing Peng, Xing Zhang, Garnet Kin‐Lic Chan

Fermionic reduced density matrices summarize the key observables in Fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest. Here, we consider the possibility of using matrix completion to reconstruct the two-particle reduced density matrix to chemical accuracy from partial information. We consider the case of noiseless matrix completion, where the partial information corresponds to a subset of the 2-RDM elements, as well as noisy completion, where the partial information corresponds to both a subset of elements and statistical noise in their values. Through experiments on a set of 24 molecular systems, we find that 2-RDM can be efficiently reconstructed from a reduced amount of information. In the case of noisy completion, this results in a multiple orders of magnitude reduction in the number of measurements needed to determine the 2-RDM with chemical accuracy. These techniques can be readily applied to both classical and quantum algorithms for quantum simulations.

arXiv:2306.05640•Journal of Chemical Theory and Computation•Dec 14, 2023•11 citations

Hardware Witnesses for Basis-Resolved Phase Readout and Nonadditive Two-Register Interference on IBM Superconducting QPUs

Yusuke Maeda

This technical report packages a set of hardware component-witness experiments run on IBM superconducting quantum processors. The experiments test whether a hidden auxiliary phase can affect a later system-qubit measurement, whether that phase can be recovered from basis-resolved readout, and whether two auxiliary registers can produce a nonadditive response rather than a simple sum of their individual effects. The package includes the report draft, figures, raw hardware result JSONs, raw-count appendix, and scripts for regenerating the figures and count tables. The central result chain is: echo/phase response on real hardware, basis-resolved phase readout without density-matrix tomography, and a two-register Y-basis nonadditivity test where the first run remains a frozen FAIL and an independent higher-shot replication reaches STRONG_PASS. The longer-term motivation is to develop small, testable quantum hardware primitives for systems that can preserve, read out, and combine latent histories or unchosen alternatives, instead of reducing every intermediate state to a single classical output immediately. In that sense, these experiments are intended as early building blocks for future quantum-assisted sequence or language-model architectures. This work does not claim a completed quantum language model, natural-language processing on a quantum computer, consciousness, selfhood, classical impossibility, or quantum advantage. It reports only hardware component witnesses on specific IBM backends, edges, and calibration windows, with the possibility of richer classical explanations left open.

•Jun 28, 2026•0 citations

COMPUTER SIMULATION OF QUANTUM PHYSICS EXPERIMENTS

GANIYA ORMANOVA

National Center for Higher Education Development•Jan 1, 2022•0 citations
We present a technique for reducing the computational requirements by several orders of magnitude in the evaluation of semidefinite relaxations for bounding the set of quantum correlations arising from finite-dimensional Hilbert spaces. The technique, which we make publicly available through a user-friendly software package, relies on the exploitation of symmetries present in the optimization problem to reduce the number of variables and the block sizes in semidefinite relaxations. It is widely applicable in problems encountered in quantum information theory and enables computations that were previously too demanding. We demonstrate its advantages and general applicability in several physical problems. In particular, we use it to robustly certify the nonprojectiveness of high-dimensional measurements in a black-box scenario based on self-tests of d-dimensional symmetric informationally complete positive-operator-valued measurements.
Fermionic reduced density matrices summarize the key observables in Fermionic systems. In electronic systems, the two-particle reduced density matrix (2-RDM) is sufficient to determine the energy and most physical observables of interest. Here, we consider the possibility of using matrix completion to reconstruct the two-particle reduced density matrix to chemical accuracy from partial information. We consider the case of noiseless matrix completion, where the partial information corresponds to a subset of the 2-RDM elements, as well as noisy completion, where the partial information corresponds to both a subset of elements and statistical noise in their values. Through experiments on a set of 24 molecular systems, we find that 2-RDM can be efficiently reconstructed from a reduced amount of information. In the case of noisy completion, this results in a multiple orders of magnitude reduction in the number of measurements needed to determine the 2-RDM with chemical accuracy. These techniques can be readily applied to both classical and quantum algorithms for quantum simulations.
This technical report packages a set of hardware component-witness experiments run on IBM superconducting quantum processors. The experiments test whether a hidden auxiliary phase can affect a later system-qubit measurement, whether that phase can be recovered from basis-resolved readout, and whether two auxiliary registers can produce a nonadditive response rather than a simple sum of their individual effects. The package includes the report draft, figures, raw hardware result JSONs, raw-count appendix, and scripts for regenerating the figures and count tables. The central result chain is: echo/phase response on real hardware, basis-resolved phase readout without density-matrix tomography, and a two-register Y-basis nonadditivity test where the first run remains a frozen FAIL and an independent higher-shot replication reaches STRONG_PASS. The longer-term motivation is to develop small, testable quantum hardware primitives for systems that can preserve, read out, and combine latent histories or unchosen alternatives, instead of reducing every intermediate state to a single classical output immediately. In that sense, these experiments are intended as early building blocks for future quantum-assisted sequence or language-model architectures. This work does not claim a completed quantum language model, natural-language processing on a quantum computer, consciousness, selfhood, classical impossibility, or quantum advantage. It reports only hardware component witnesses on specific IBM backends, edges, and calibration windows, with the possibility of richer classical explanations left open.