121 citations · 992 across the 38 of their papers we have counts for
36 papers · 1 filter
Approximate reconstructability of quantum states and noisy quantum secret sharing schemes
Yingkai Ouyang, Kaumudibikash Goswami, Jacquiline Romero +3
We introduce and analyse approximate quantum secret sharing in a formal cryptographic setting, wherein a dealer encodes and distributes a quantum secret to players such that author…
Finite-round quantum error correction on symmetric quantum sensors
Yingkai Ouyang, Gavin K. Brennen
In quantum sensing using entangled probes, the variance of the estimated signal strength scales like at the Heisenberg limit, which is a quadratic improvem…
Tight Cramér-Rao type bounds for multiparameter quantum metrology through conic programming
Masahito Hayashi, Yingkai Ouyang
In the quest to unlock the maximum potential of quantum sensors, it is of paramount importance to have practical measurement strategies that can estimate incompatible parameters wi…
Learning quantum graph states with product measurements
Yingkai Ouyang, Marco Tomamichel
We consider the problem of learning identical copies of an unknown -qubit quantum graph state with product measurements. These graph states have corresponding graphs where e…
Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
Yanglin Hu, Yingkai Ouyang, Marco Tomamichel
Quantum homomorphic encryption, which allows computation by a server directly on encrypted data, is a fundamental primitive out of which more complex quantum cryptography protocols…
Permutational-key quantum homomorphic encryption with homomorphic quantum error-correction
Yingkai Ouyang, Peter P. Rohde
The gold-standard for security in quantum cryptographic protocols is information-theoretic security. Information-theoretic security is surely future-proof, because it makes no assu…
Imaging stars with quantum error correction
Zixin Huang, Gavin K. Brennen, Yingkai Ouyang
The development of high-resolution, large-baseline optical interferometers would revolutionize astronomical imaging. However, classical techniques are hindered by physical limitati…
Linear programming bounds for quantum channels acting on quantum error-correcting codes
Yingkai Ouyang, Ching-Yi Lai
While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the p…
Quantum key distribution with non-ideal heterodyne detection: composable security of discrete-modulation continuous-variable protocols
Cosmo Lupo, Yingkai Ouyang
Continuous-variable quantum key distribution exploits coherent measurements of the electromagnetic field, i.e., homodyne or heterodyne detection. The most advanced security proofs…
The equivalence between correctability of deletions and insertions of separable states in quantum codes
Taro Shibayama, Yingkai Ouyang
In this paper, we prove the equivalence of inserting separable quantum states and deletions. Hence any quantum code that corrects deletions automatically corrects separable inserti…
Permutation-invariant quantum coding for quantum deletion channels
Yingkai Ouyang
Quantum deletions, which are harder to correct than erasure errors, occur in many realistic settings. It is therefore pertinent to develop quantum coding schemes for quantum deleti…
Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians
Ramis Movassagh, Yingkai Ouyang
Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes {\it any} classical code an…
Avoiding coherent errors with rotated concatenated stabilizer codes
Yingkai Ouyang
Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors.…
Trade-offs on number and phase shift resilience in bosonic quantum codes
Yingkai Ouyang, Earl T. Campbell
Quantum codes typically rely on large numbers of degrees of freedom to achieve low error rates. However each additional degree of freedom introduces a new set of error mechanisms.…
Quantifying quantum speedups: improved classical simulation from tighter magic monotones
James R. Seddon, Bartosz Regula, Hakop Pashayan +2
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such…
Linear programming bounds for quantum amplitude damping codes
Yingkai Ouyang, Ching-Yi Lai
Given that approximate quantum error-correcting (AQEC) codes have a potentially better performance than perfect quantum error correction codes, it is pertinent to quantify their pe…
Tight bounds on the simultaneous estimation of incompatible parameters
Jasminder S. Sidhu, Yingkai Ouyang, Earl T. Campbell +1
The estimation of multiple parameters in quantum metrology is important for a vast array of applications in quantum information processing. However, the unattainability of fundamen…
Compilation by stochastic Hamiltonian sparsification
Yingkai Ouyang, David R. White, Earl T. Campbell
Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantu…
Robust quantum metrology with explicit symmetric states
Yingkai Ouyang, Nathan Shettell, Damian Markham
Quantum metrology is a promising practical use case for quantum technologies, where physical quantities can be measured with unprecedented precision. In lieu of quantum error corre…
Quantum storage in quantum ferromagnets
Yingkai Ouyang
We must protect inherently fragile quantum data to unlock the potential of quantum technologies. A pertinent concern in schemes for quantum storage is their potential for near-term…
Homomorphic encryption of linear optics quantum computation on almost arbitrary states of light with asymptotically perfect security
Yingkai Ouyang, Si-Hui Tan, Joseph Fitzsimons +1
Future quantum computers are likely to be expensive and affordable outright by few, motivating client/server models for outsourced computation. However, the applications for quantu…
Faster quantum computation with permutations and resonant couplings
Yingkai Ouyang, Yi Shen, Lin Chen
Recently, there has been increasing interest in designing schemes for quantum computations that are robust against errors. Although considerable research has been devoted to develo…
Permutation-invariant constant-excitation quantum codes for amplitude damping
Yingkai Ouyang, Rui Chao
The increasing interest in using quantum error correcting codes in practical devices has heightened the need for designing quantum error correcting codes that can correct against s…
Causal limit on quantum communication
Robert Pisarczyk, Zhikuan Zhao, Yingkai Ouyang +2
The capacity of a channel is known to be equivalent to the highest rate at which it can generate entanglement. Analogous to entanglement, the notion of a causality measure characte…