The approximate stellar rank serves as an operational measure of non-Gaussianity that yields bounds and new no-go results for approximate and probabilistic Gaussian state conversion and distillation.
Bosonic coding: introduction and use cases,
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
fields
quant-ph 4verdicts
UNVERDICTED 4representative citing papers
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
The authors describe a visionary layered architecture for unifying classical and quantum compute resources under a single job submission and scheduling interface.
A literature review synthesizing developments in quantum Wasserstein distances, their applications, and unresolved questions.
citing papers explorer
-
Assessing non-Gaussian quantum state conversion with the stellar rank
The approximate stellar rank serves as an operational measure of non-Gaussianity that yields bounds and new no-go results for approximate and probabilistic Gaussian state conversion and distillation.
-
Entanglement and circuit complexity in finite-depth random linear optical networks
In finite-depth random linear optical circuits, entanglement grows at most diffusively and robust circuit complexity scales similarly, with depth bounds ensuring near-maximal subsystem entanglement and closeness to Haar unitaries.
-
Quantum Integrated High-Performance Computing: Foundations, Architectural Elements and Future Directions
The authors describe a visionary layered architecture for unifying classical and quantum compute resources under a single job submission and scheduling interface.
-
Wasserstein Distances on Quantum Structures: an Overview
A literature review synthesizing developments in quantum Wasserstein distances, their applications, and unresolved questions.