R.I.P.
π»
Ghosted
Quantum Optimal Multiple Assignment Scheme for Realizing General Access Structure of Secret Sharing
February 03, 2017 Β· Declared Dead Β· π IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ryutaroh Matsumoto
arXiv ID
1702.00942
Category
quant-ph: Quantum Computing
Cross-listed
cs.CR,
cs.IT
Citations
3
Venue
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Last Checked
5 months ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted