53 citations · 257 across the 11 of their papers we have counts for
12 papers
Solving approximate hidden subgroup problems: quantum heuristics to detect weak entanglement
Petar Simidzija, Eugene Koskin, Elton Yechao Zhu +2
How can we use a quantum computer to detect the entanglement structure of a quantum state? Bouland et al. (2024) recently provided an algorithm that, given multiple input copies of…
Scalable iterative pruning of large language and vision models using block coordinate descent
Gili Rosenberg, J. Kyle Brubaker, Martin J. A. Schuetz +4
Pruning neural networks, which involves removing a fraction of their weights, can often maintain high accuracy while significantly reducing model complexity, at least up to a certa…
Solving QUBOs with a quantum-amenable branch and bound method
Thomas Häner, Kyle E. C. Booth, Sima E. Borujeni +1
Due to the expected disparity in quantum vs. classical clock speeds, quantum advantage for branch and bound algorithms is more likely achievable in settings involving large search…
Explainable AI using expressive Boolean formulas
Gili Rosenberg, J. Kyle Brubaker, Martin J. A. Schuetz +6
We propose and implement an interpretable machine learning classification model for Explainable AI (XAI) based on expressive Boolean formulas. Potential applications include credit…
Quantum State Preparation of Normal Distributions using Matrix Product States
Jason Iaconis, Sonika Johri, Elton Yechao Zhu
State preparation is a necessary component of many quantum algorithms. In this work, we combine a method for efficiently representing smooth differentiable probability distribution…
Iteration Complexity of Variational Quantum Algorithms
Vyacheslav Kungurtsev, Georgios Korpas, Jakub Marecek +1
There has been much recent interest in near-term applications of quantum computers, i.e., using quantum circuits that have short decoherence times due to hardware limitations. Vari…
Generative Quantum Learning of Joint Probability Distribution Functions
Elton Yechao Zhu, Sonika Johri, Dave Bacon +9
Modeling joint probability distributions is an important task in a wide variety of fields. One popular technique for this employs a family of multivariate distributions with unifor…
Generalized Entanglement Entropies of Quantum Designs
Zi-Wen Liu, Seth Lloyd, Elton Yechao Zhu +1
The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high…
Superadditivity in trade-off capacities of quantum channels
Elton Yechao Zhu, Quntao Zhuang, Min-Hsiu Hsieh +1
In this article, we investigate the additivity phenomenon in the dynamic capacity of a quantum channel for trading classical communication, quantum communication and entanglement.…
Superadditivity of the Classical Capacity with Limited Entanglement Assistance
Elton Yechao Zhu, Quntao Zhuang, Peter W. Shor
Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. Entanglement assistan…
Entanglement, quantum randomness, and complexity beyond scrambling
Zi-Wen Liu, Seth Lloyd, Elton Yechao Zhu +1
Scrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that "hides" initially localized quantum information. In thi…
Additive Classical Capacity of Quantum Channels Assisted by Noisy Entanglement
Quntao Zhuang, Elton Yechao Zhu, Peter W. Shor
We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the rece…