Upper Bounds on the Distillable Randomness of Bipartite Quantum States.
Ludovico LamiBartosz RegulaXin WangMark M. WildePublished in: CoRR (2022)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- lower and upper bounds
- worst case
- branch and bound algorithm
- bipartite graph
- tight bounds
- real valued
- quantum computation
- quantum computing
- initial state
- graph model
- quantum inspired
- efficiently computable
- branch and bound
- sample complexity
- tight upper and lower bounds
- quantum mechanics
- optimal policy
- hidden markov models