Search Results - "Yaoyun Shi"

Characterizing Locally Indistinguishable Orthogonal Product States by Feng, Yuan, Shi, Yaoyun

“…Bennett [ Physical Review A , vol. 59, no. 2, p. 1070, 1999] identified a set of orthogonal product states in the Hilbert space \BBC 3 otimes\BBC 3 such that…”
Get full text

Scalable Surface-Code Decoders with Parallelization in Time by Tan, Xinyu, Zhang, Fang, Chao, Rui, Shi, Yaoyun, Chen, Jianxin

“…Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast…”
Get full text

Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States by Jain, Rahul, Yaoyun Shi, Zhaohui Wei, Shengyu Zhang

“…We investigate the fundamental problem of generating bipartite classical distributions or quantum states. By designing efficient communication protocols and…”
Get full text

On the parity complexity measures of Boolean functions by Zhang, Zhiqiang, Shi, Yaoyun

“…The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic…”
Get full text

The communication complexity of the Hamming distance problem by Huang, Wei, Shi, Yaoyun, Zhang, Shengyu, Zhu, Yufan

“…We investigate the randomized and quantum communication complexity of the Hamming Distance problem, which is to determine if the Hamming distance between two…”
Get full text

Constant-Degree Graph Expansions that Preserve Treewidth by Markov, Igor L., Shi, Yaoyun

“…Many hard algorithmic problems dealing with graphs, circuits, formulas and constraints admit polynomial-time upper bounds if the underlying graph has small…”
Get full text

Quantum and classical tradeoffs by Shi, Yaoyun

“…We initiate the study of quantifying the quantumness of a quantum circuit by the number of gates that do not preserve the computational basis, as a means to…”
Get full text

Path auctions with multiple edge ownership by Du, Ye, Sami, Rahul, Shi, Yaoyun

“…In this paper, we study path auction games in which multiple edges may be owned by the same agent. The edge costs and the set of edges owned by the same agent…”
Get full text

Parallel Device-Independent Quantum Key Distribution by Jain, Rahul, Miller, Carl A., Shi, Yaoyun

“…A prominent application of quantum cryptography is the distribution of cryptographic keys that are provably secure. Such security proofs were extended by…”
Get full text

Multipartite-to-bipartite entanglement transformations and polynomial identity testing by Chitambar, Eric, Duan, Runyao, Shi, Yaoyun

“…We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure…”
Get full text

Epsilon-net method for optimizations over separable states by Shi, Yaoyun, Wu, Xiaodi

“…We give algorithms for the optimization problem: maxρ⁡〈Q,ρ〉, where Q is a Hermitian matrix, and the variable ρ is a bipartite separable quantum state. This…”
Get full text

Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables by Shi, Yaoyun

“…We prove that, to compute a total Boolean function f on N variables with bounded error probability, any quantum black-box algorithm has to query at least Ω(ρ…”
Get full text

Fluxonium: An Alternative Qubit Platform for High-Fidelity Operations by Bao, Feng, Deng, Hao, Ding, Dawei, Gao, Ran, Gao, Xun, Huang, Cupjin, Jiang, Xun, Ku, Hsiang-Sheng, Li, Zhisheng, Ma, Xizheng, Ni, Xiaotong, Qin, Jin, Song, Zhijun, Sun, Hantao, Tang, Chengchun, Wang, Tenghui, Wu, Feng, Xia, Tian, Yu, Wenlong, Zhang, Fang, Zhang, Gengyan, Zhang, Xiaohang, Zhou, Jingwei, Zhu, Xing, Shi, Yaoyun, Chen, Jianxin, Zhao, Hui-Hai, Deng, Chunqing

Get full text

Entropy lower bounds for quantum decision tree complexity by Shi, Yaoyun

“…We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard decision tree computation as a communication…”
Get full text

Tripartite entanglement transformations and tensor rank by Chitambar, Eric, Duan, Runyao, Shi, Yaoyun

“…A basic question regarding quantum entangled states is whether one can be probabilistically converted to another through local operations and classical…”
Get full text

Quantum Instruction Set Design for Performance by Huang, Cupjin, Wang, Tenghui, Wu, Feng, Ding, Dawei, Ye, Qi, Kong, Linghang, Zhang, Fang, Ni, Xiaotong, Song, Zhijun, Shi, Yaoyun, Zhao, Hui-Hai, Deng, Chunqing, Chen, Jianxin

“…A quantum instruction set is where quantum hardware and software meet. We develop characterization and compilation techniques for non-Clifford gates to…”
Get full text

Entanglement between two uses of a noisy multipartite quantum channel enables perfect transmission of classical information by Duan, Runyao, Shi, Yaoyun

“…Suppose that m senders want to transmit classical information to n receivers with zero probability of error using a noisy multipartite communication channel…”
Get full text

Native Approach to Controlled-Z Gates in Inductively Coupled Fluxonium Qubits by Ma, Xizheng, Zhang, Gengyan, Wu, Feng, Bao, Feng, Chang, Xu, Chen, Jianjun, Deng, Hao, Gao, Ran, Gao, Xun, Hu, Lijuan, Ji, Honghong, Ku, Hsiang-Sheng, Lu, Kannan, Ma, Lu, Mao, Liyong, Song, Zhijun, Sun, Hantao, Tang, Chengchun, Wang, Fei, Wang, Hongcheng, Wang, Tenghui, Xia, Tian, Ying, Make, Zhan, Huijuan, Zhou, Tao, Zhu, Mengyu, Zhu, Qingbin, Shi, Yaoyun, Zhao, Hui-Hai, Deng, Chunqing

“…The fluxonium qubits have emerged as a promising platform for gate-based quantum information processing. However, their extraordinary protection against charge…”
Get full text

Efficient parallelization of tensor network contraction for simulating quantum computation by Huang, Cupjin, Zhang, Fang, Newman, Michael, Ni, Xiaotong, Ding, Dawei, Cai, Junjie, Gao, Xun, Wang, Tenghui, Wu, Feng, Zhang, Gengyan, Ku, Hsiang-Sheng, Tian, Zhengxiong, Wu, Junyin, Xu, Haihong, Yu, Huanjun, Yuan, Bo, Szegedy, Mario, Shi, Yaoyun, Zhao, Hui-Hai, Deng, Chunqing, Chen, Jianxin

“…We develop an algorithmic framework for contracting tensor networks and demonstrate its power by classically simulating quantum computation of sizes previously…”
Get full text

Ultrahigh Kinetic Inductance Superconducting Materials from Spinodal Decomposition by Gao, Ran, Ku, Hsiang‐Sheng, Deng, Hao, Yu, Wenlong, Xia, Tian, Wu, Feng, Song, Zhijun, Wang, Minghua, Miao, Xiaohe, Zhang, Chao, Lin, Yue, Shi, Yaoyun, Zhao, Hui‐Hai, Deng, Chunqing

“…Disordered superconducting nitrides with kinetic inductance have long been considered to be leading material candidates for high‐inductance quantum‐circuit…”
Get full text