51 citations · 51 across the 1 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
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…