activity
20002022
most citedEntanglement by a beam splitter: nonclassicality as a prerequisite for entanglement

560 citations · 2.9k across the 43 of their papers we have counts for

collaborators
Showing 2022Show all

8 papers · 1 filter

quant-ph2022★ 1 cited

Gravity mediated entanglement between light beams as a table-top test of quantum gravity

Stefan Aimet, Hadrien Chevalier, M. S. Kim

Over the past century, a large community within theoretical physics has been seeking a unified framework for quantum gravity. Yet, to date, there is still no experimental evidence…

quant-ph2022★ 55 cited

Scalable and Programmable Phononic Network with Trapped Ions

Wentao Chen, Yao Lu, Shuaining Zhang +9

Controllable bosonic systems can provide post-classical computational power with sub-universal quantum computational capability. A network that consists of a number of bosons evolv…

quant-ph2022★ 6 cited

Clifford Circuit Initialisation for Variational Quantum Algorithms

M. H. Cheng, K. E. Khosla, C. N. Self +4

We present an initialisation method for variational quantum algorithms applicable to intermediate scale quantum computers. The method uses simulated annealing of the efficiently si…

quant-ph2022★ 2 cited

Unifying Sørensen-Mølmer gate and Milburn gate with an optomechanical example

Yue Ma, Manuel C. C. Pace, M. S. Kim

Sørensen-Mølmer gate and Milburn gate are two geometric phase gates, generating nonlinear self-interaction of a target mode via its interaction with an auxiliary mechanical mode, i…

quant-ph2022★ 112 cited

Scalable measures of magic resource for quantum computers

Tobias Haug, M. S. Kim

Non-stabilizerness or magic resource characterizes the amount of non-Clifford operations needed to prepare quantum states. It is a crucial resource for quantum computing and a nece…

quant-ph2022★ 3 cited

Fault-tolerance in qudit circuit design

Michael Hanks, M. S. Kim

The efficient decomposition of multi-controlled gates is a significant factor in quantum compiling, both in circuit depth and T-gate count. Recent work has demonstrated that qudits…

quant-ph2022★ 8 cited

Faster Born probability estimation via gate merging and frame optimisation

Nikolaos Koukoulekidis, Hyukjoon Kwon, Hyejung H. Jee +2

Outcome probability estimation via classical methods is an important task for validating quantum computing devices. Outcome probabilities of any quantum circuit can be estimated us…

quant-ph2022★ 9 cited

Noise thresholds for classical simulability of non-linear Boson sampling

Gabriele Bressanini, Hyukjoon Kwon, M. S. Kim

Boson sampling, a computational problem conjectured to be hard to simulate on a classical machine, is a promising candidate for an experimental demonstration of quantum advantage u…