In multi-copy state discrimination, qubit strategies beat bit strategies, but some bit-like operational theories outperform qubits even classically, revealing nonlocality without entanglement and providing general bounds.
Title resolution pending
6 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
fields
quant-ph 6verdicts
UNVERDICTED 6roles
background 1polarities
background 1representative citing papers
Develops a threshold-regularized Moore-Penrose pseudoinverse formulation of PGM with hybrid classical-quantum circuit implementation using block-encoding for stable discrimination in ill-conditioned and rank-deficient ensembles.
Nonlinear Hamiltonians on ancilla qubits enable efficient solution of UNIQUE SAT with ⟨σ^z⟩σ^z, 3SAT with ⟨σ^x⟩σ^y - ⟨σ^y⟩σ^x, and #SAT with ⟨σ^y⟩⟨σ^z⟩σ^x - ⟨σ^x⟩⟨σ^z⟩σ^y nonlinearity.
Proposes a context-aware unit testing framework for quantum subroutines modeled as parametrized quantum channels, using probabilistic assertions and demonstrated on GHZ preparation and Shor's algorithm subroutines.
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.
In the large-N limit, spin squeezing torsion yields a nonlinear qubit governed by the two-state Gross-Pitaevskii equation that solves single-input state discrimination on the Bloch sphere.
citing papers explorer
-
Nonclassical traits in multi-copy state discrimination
In multi-copy state discrimination, qubit strategies beat bit strategies, but some bit-like operational theories outperform qubits even classically, revealing nonlocality without entanglement and providing general bounds.
-
Robust Pretty Good Measurement via Hybrid Classical-Quantum Pseudoinverse Approximation and Circuit-Level Realization
Develops a threshold-regularized Moore-Penrose pseudoinverse formulation of PGM with hybrid classical-quantum circuit implementation using block-encoding for stable discrimination in ill-conditioned and rank-deficient ensembles.
-
Nonlinear Hamiltonians and Boolean satisfiability
Nonlinear Hamiltonians on ancilla qubits enable efficient solution of UNIQUE SAT with ⟨σ^z⟩σ^z, 3SAT with ⟨σ^x⟩σ^y - ⟨σ^y⟩σ^x, and #SAT with ⟨σ^y⟩⟨σ^z⟩σ^x - ⟨σ^x⟩⟨σ^z⟩σ^y nonlinearity.
-
Context-Aware Unit Testing for Quantum Subroutines
Proposes a context-aware unit testing framework for quantum subroutines modeled as parametrized quantum channels, using probabilistic assertions and demonstrated on GHZ preparation and Shor's algorithm subroutines.
-
Security of deterministic key distribution with higher-dimensional systems
Higher-dimensional two-way QKD protocols using mutually unbiased bases and Heisenberg-Weyl operators yield secret keys for stronger individual attacks and improved robustness to collective eavesdropping via entropic uncertainty relations.
-
From spin squeezing to fast state discrimination
In the large-N limit, spin squeezing torsion yields a nonlinear qubit governed by the two-state Gross-Pitaevskii equation that solves single-input state discrimination on the Bloch sphere.