arXiv subjects

Sarah Hagen

Publications and source records attributed to Sarah Hagen.

5 recordsLinked to original sources

arXiv2026

Quantum Secret Sharing with a Helper and Programmable Access Structures

Quantum secret sharing (QSS) is a process in which the state of a quantum system is partitioned into multiple shares, allowing only specific subsets of shareholders to reconstruct the state, while others gain no information about its identity. In this work, we propose a variant of QSS, called ``helper QSS,'' which designates a special shareholder whose participation with any other group of parties is sufficient for recovering the state. We present different families of helper codes that function for an arbitrary number of parties and system sizes. As an application, we introduce the idea of a programmable access structure in QSS, which allows for a third-party programmer to independently choose the access structure of the code even after the shares are delivered to all the shareholders. This choice is made blindly, meaning that the programmer has no information about the secret being encoded, and it is implemented using the nonlocal process of quantum steering.

quant-ph↗

arXiv2026

Codes for Quantum Secret Sharing with a Helper

Helper quantum secret sharing is a form of secret sharing defined by its unique access structure. One special fixed party, called the helper, can work together with any other party to fully decode the secret. A blind helper is one who can provide this assistance while not holding any local information about the encoded secret. In this work, we analyze the general structure of QSS helper codes and present new code constructions. We fully characterize the structure of blind helper stabilizer codes and show that for the encoding of a single qubit, recovery is always possible using one-way local operations and classical communication (LOCC) from the helper to the targeted party. Furthermore, we demonstrate how such codes also allow for the helper to target larger subsets of parties by one-way LOCC, enabling them to be authorized to recover the secret. Finally, when each party only holds a qubit, we identify the general form of all helper codes (including non-stabilizer codes) and find that LOCC recovery is only possible in special cases.

quant-ph↗

arXiv2025

Structure Theorem for Quantum Replacer Codes

Quantum replacer codes are codes that can be protected from errors induced by a given set of quantum replacer channels, an important class of quantum channels that includes the erasures of subsets of qubits that arise in quantum error correction. We prove a structure theorem for such codes that synthesizes a variety of special cases with earlier theoretical work in quantum error correction. We present several examples and applications of the theorem, including a mix of new observations and results together with some subclasses of codes revisited from this new perspective.

quant-ph↗

arXiv2021

Detecting Initial System-Environment Correlations in Open Systems

Correlations between a system and its environment lead to errors in an open quantum system. Detecting those correlations would be valuable for avoiding and/or correcting those errors. Here we show that we can detect correlations by only measuring the system itself if we know the cause of the interaction between the two, for example in the case of a dipole-dipole interaction. We investigate the unitary $U$ which is associated with the exchange Hamiltonian and examine the ability to detect initial correlations between a system and its environment for various types of initial states. The states we select are motivated by realistic experimental conditions and we provide bounds for when we can state with certainty that there are initial system-environment correlations given experimental data.

quant-ph↗

arXiv2015

Bases and Structure Constants of Generalized Splines with Integer Coefficients on Cycles

An integer generalized spline is a set of vertex labels on an edge-labeled graph that satisfy the condition that if two vertices are joined by an edge, the vertex labels are congruent modulo the edge label. Foundational work on these objects comes from Gilbert, Polster, and Tymoczko, who generalize ideas from geometry/topology (equivariant cohomology rings) and algebra (algebraic splines) to develop the notion of generalized splines. Gilbert, Polster, and Tymoczko prove that the ring of splines on a graph can be decomposed in terms of splines on its subgraphs (in particular, on trees and cycles), and then fully analyze splines on trees. Following Handschy-Melnick-Reinders and Rose, we analyze splines on cycles, in our case integer generalized splines. The primary goal of this paper is to establish two new bases for the module of integer generalized splines on cycles: the triangulation basis and the King basis. Unlike bases in previous work, we are able to characterize each basis element completely in terms of the edge labels of the underlying cycle. As an application we explicitly construct the multiplication table for the ring of integer generalized splines in terms of the King basis.

math.RA↗