What is the best worst-case guarantee one can make on the number of bends required to embed a graph into a particular grid, in particular, the hexagonal and octagonal grids? A grid pointdrawing of a...
What is the best worst-case guarantee one can make on the number of bends required to embed a graph into a particular grid, in particular, the hexagonal and octagonal grids? A grid pointdrawing of a...
Rahul Jain, U. Waterloo, Ashwin Nayak, Yi Su, U. Waterloo
The notion of divergence information of an ensemble of probability distributions was introduced by Jain, Radhakrishnan, and Sen [5, 7] in the context of the “substate theorem”. Since then,...
Rahul Jain, U. Waterloo, Hartmut Klauck, Ashwin Nayak, U. Waterloo
A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance....
Rahul Jain, U. Waterloo, Hartmut Klauck, Ashwin Nayak, U. Waterloo
A basic question in complexity theory is whether the computational resources required for solving k independent instances of the same problem scale as k times the resources required for one instance....
Accessible versus Holevo information for a binary random variable (2006)
Rahul Jain, U. Waterloo, Ashwin Nayak
The accessible information Iacc(E) of an ensemble E is the maximum mutual information between a random variable encoded into quantum states, and the probabilistic outcome of a quantum measurement of...