arXiv subjects

Stanley Miao

Publications and source records attributed to Stanley Miao.

4 recordsLinked to original sources

arXiv2026

Entanglement summoning from entanglement sharing

In an entanglement summoning task, a set of distributed, co-operating parties attempt to fulfill requests to prepare entanglement between distant locations. The parties share limited communication resources: timing constraints may require the entangled state be prepared before some pairs of distant parties can communicate, and a restricted set of links in a quantum network may further constrain communication. Building on earlier work, we continue the characterization of entanglement summoning. We give an if and only if condition on entanglement summoning tasks with only bidirected causal connections, and provide a set of sufficient conditions addressing the most general case containing both oriented and bidirected causal connections. Our results rely on the recent development of entanglement sharing schemes.

quant-ph↗

arXiv2025

Entanglement sharing schemes

We ask how quantum correlations can be distributed among many subsystems. To address this, we define entanglement sharing schemes (ESS) where certain pairs of subsystems allow entanglement to be recovered via local operations, while other pairs must not. ESS schemes come in two variants, one where the partner system with which entanglement should be prepared is known, and one where it is not. In the case of known partners, we fully characterize the access structures realizable for ESS when using stabilizer states, and construct efficient schemes for threshold access structures, and give a conjecture for the access structures realizable with general states. In the unknown partner case, we again give a complete characterization in the stabilizer setting, additionally give a complete characterization of the case where there are no restrictions on unauthorized pairs, and we prove a set of necessary conditions on general schemes which we conjecture are also sufficient. Finally, we give an application of the theory of entanglement sharing to resolve an open problem related to the distribution of entanglement in response to time-sensitive requests in quantum networks.

quant-ph↗

arXiv2024

Quantum reservoir computing using the stabilizer formalism for encoding classical data

Utilizing a quantum system for reservoir computing has recently received a lot of attention. Key challenges are related to how on can optimally en- and decode classical information, as well as what constitutes a good reservoir. Our main contribution is a generalization of the standard way to robustly en- and decode time series into subspaces defined by the cosets of a given stabilizer. A key observation is the necessity to perform the decoding step, which in turn ensures a consistent way of encoding. This provides a systematic way to encode classical information in a robust way. We provide a numerical analysis on a discrete time series given by two standard maps, namely the logistic and the Hénon map. Our numerical findings indicate that the system's performance is increasing with the length of the training data.

quant-ph↗

arXiv2024

QuantumReservoirPy: A Software Package for Time Series Prediction

In recent times, quantum reservoir computing has emerged as a potential resource for time series prediction. Hence, there is a need for a flexible framework to test quantum circuits as nonlinear dynamical systems. We have developed a software package to allow for quantum reservoirs to fit a common structure, similar to that of reservoirpy which is advertised as "a python tool designed to easily define, train and use (classical) reservoir computing architectures". Our package results in simplified development and logical methods of comparison between quantum reservoir architectures. Examples are provided to demonstrate the resulting simplicity of executing quantum reservoir computing using our software package.

quant-ph↗