Upper Bounds on the Distillable Randomness of Bipartite Quantum States.
Ludovico LamiBartosz RegulaXin WangMark M. WildePublished in: ITW (2023)
Keyphrases
- upper bound
- lower bound
- graph model
- tight bounds
- upper and lower bounds
- worst case
- real valued
- lower and upper bounds
- branch and bound algorithm
- quantum computing
- bipartite graph
- sample size
- generalization error
- branch and bound
- state transitions
- sample complexity
- concept classes
- pseudorandom number
- search engine
- error probability
- efficiently computable
- tight upper and lower bounds
- constant factor
- initial state
- image segmentation