Customer-obsessed science
Research areas
-
July 30, 20268 min readInstead of compromising among parameter updates dictated by different training objectives, ControlG allocates computational capacity to objectives sequentially and dynamically.
-
-
July 9, 202610 min read
-
Featured news
-
Journal of Decision Systems2020Assistive technology featuring artificial intelligence (AI) to support human decision-making has become ubiquitous. Assistive AI achieves accuracy comparable to or even surpassing that of human experts. However, often the adoption of assistive AI systems is limited by a lack of trust of humans into an AI’s prediction. This is why the AI research community has been focusing on rendering AI decisions more
-
npj Quantum Information2020The overhead cost of performing universal fault-tolerant quantum computation for large scale quantum algorithms is very high. Despite several attempts at alternative schemes, magic state distillation remains one of the most efficient schemes for simulating non-Clifford gates in a fault-tolerant way. However, since magic state distillation circuits are not fault-tolerant, all Clifford operations must be
-
QIP 20202020For quantum spin systems in any spatial dimension with a local, translation-invariant Hamiltonian, we prove that asymptotic state convertibility from a quantum state to another one by a thermodynamically feasible class of quantum dynamics, called thermal operations,is completely characterized by the Kullback-Leibler (KL) divergence rate, if the state is translation-invariant and spatially ergodic. Our proof
-
TQC 20202020We give a quantum speedup for solving the canonical semidefinite programming relaxation for binary quadratic optimization. The class of relaxations for combinatorial optimization has so far eluded quantum speedups. Our methods combine ideas from quantum Gibbs sampling and matrix exponent updates. A de-quantization of the algorithm also leads to a faster classical solver. For generic instances, our quantum
-
QIP 20202020We prove that quantum Gibbs states of spin systems above a certain threshold temperature are approximate quantum Markov networks, meaning that the conditional mutual information decays rapidly with distance. We prove exponential decay (power-law decay) for short-ranged (long-ranged) interacting systems. As consequences, we establish the efficiency of quantum Gibbs sampling algorithms, a strong version of
Collaborations
View allWhether you're a faculty member or student, there are number of ways you can engage with Amazon.
View all