22 citations · 35 across the 6 of their papers we have counts for
6 papers
Quantum Supremacy Circuit Simulation on Sunway TaihuLight
Riling Li, Bujiao Wu, Mingsheng Ying +2
With the rapid progress made by industry and academia, quantum computers with dozens of qubits or even larger size are being realized. However, the fidelity of existing quantum com…
Tighter Relations Between Sensitivity and Other Complexity Measures
Andris Ambainis, Mohammad Bavarian, Yihan Gao +3
Sensitivity conjecture is a longstanding and fundamental open problem in the area of complexity measures of Boolean functions and decision tree complexity. The conjecture postulate…
New separation between and
Andris Ambainis, Xiaoming Sun
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: .
Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-Prover Interactive Proof Systems
Tsuyoshi Ito, Hirotada Kobayashi, Daniel Preda +2
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as multi…
Searching Monotone Multi-dimensional Arrays
Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin
In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks' search algorithm \cite{LS1} for monotone 3-dimensional array…
The Existence of Quantum Entanglement Catalysts
Xiaoming Sun, Runyao Duan, Mingsheng Ying
Without additional resources, it is often impossible to transform one entangled quantum state into another with local quantum operations and classical communication. Jonathan and P…