pith. sign in

hub Canonical reference

Abanin, Laleh Aghababaie-Beni, Igor Aleiner, Trond I

Canonical reference. 100% of citing Pith papers cite this work as background.

38 Pith papers citing it
598 external citations · Crossref
Background 100% of classified citations

hub tools

citation-role summary

background 7

citation-polarity summary

roles

background 7

polarities

background 7

clear filters

representative citing papers

Memory-assisted multimode microwave-to-optical transduction

quant-ph · 2026-05-02 · unverdicted · novelty 7.0

First experimental demonstration of memory-assisted on-demand multimode microwave-to-optical transduction with 0.3-0.4 noise photons at 460-620 microsecond storage in a 171Yb3+:Y2SiO5 crystal at 30 mK.

Hybrid Path-Sums for Hybrid Quantum Programs

cs.PL · 2026-04-27 · unverdicted · novelty 7.0

Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.

Quantum circuit complexity and unsupervised machine learning of topological order

quant-ph · 2025-08-06 · unverdicted · novelty 7.0

Nielsen quantum circuit complexity is positioned as a topological distance for unsupervised learning of topological order, with theorems linking it to Bures distance and entanglement to yield practical fidelity- and entanglement-based kernels demonstrated on XXZ chains and toric code.

Fault-tolerant quantum computation with a neutral atom processor

quant-ph · 2024-11-18 · accept · novelty 7.0

A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.

Barbell Codes: qLDPC Codes for Superconducting Quantum Hardware

quant-ph · 2026-06-04 · unverdicted · novelty 6.0

Barbell codes are a family of qLDPC codes with a matching superconducting chip layout enabling constant hardware complexity, simulated to preserve logical information over trillions of QEC cycles at 10^{-4} physical noise with under 30 data qubits per logical qubit.

Stabilizers for Compiling Logical Circuits under Hardware Constraints

quant-ph · 2026-04-27 · unverdicted · novelty 6.0

Stabilizer redundancy from error-correcting codes reduces the choice of physical operators for a logical target to a least-squares problem with closed-form solution, allowing native hardware Hamiltonians to replace costly swaps.

Data-Driven Hamiltonian Reduction for Superconducting Qubits via Meta-Learning

quant-ph · 2026-04-27 · unverdicted · novelty 6.0

HAML meta-learns a mapping from control inputs and device parameters to effective two-qubit Hamiltonian coefficients via simulation training, then adapts online with few measurements, recovering coefficients where Schrieffer-Wolff perturbation theory fails.

Efficient Simulation of Sparse, Non-Local Fermion Models

quant-ph · 2025-12-17 · unverdicted · novelty 6.0

An auxiliary-fermion encoding removes Jordan-Wigner strings for sparse non-local fermion models, achieving asymptotically optimal Trotter circuit depth on qubits after one-time state preparation.

Architecting Distributed Quantum Computers: Design Insights from Resource Estimation

quant-ph · 2025-08-26 · unverdicted · novelty 6.0

A resource estimation framework for distributed fault-tolerant quantum computers based on lattice surgery identifies feasible hardware configurations for eight applications across thousands of setups, showing that architecture design must be guided by resource analysis for scalability.

Superconducting Qubit Readout Using Next-Generation Reservoir Computing

quant-ph · 2025-06-18 · unverdicted · novelty 6.0

Reservoir computing using polynomial features from measurement signals achieves up to 50% error reduction on single-qubit and 11% on five-qubit datasets with 100x fewer multiplications than neural networks while reducing crosstalk.

citing papers explorer

Showing 1 of 1 citing paper after filters.