# Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing

## TL;DR

This paper introduces a quantum version of the multiple assignment scheme for secret sharing, enabling realization of general access structures, and proposes an optimization method to minimize share size.

## Contribution

It presents a novel quantum multiple assignment scheme for secret sharing and an integer optimization approach to reduce share sizes.

## Key findings

- Quantum scheme successfully realizes general access structures.
- Optimization reduces average share size in secret sharing.
- Framework extends classical schemes to quantum context.

## Abstract

The multiple assignment scheme is to assign one or more shares to single participant so that any kind of access structure can be realized by classical secret sharing schemes. We propose its quantum version including ramp secret sharing schemes. Then we propose an integer optimization approach to minimize the average share size.