Dax Enshan Koh

According to our database, Dax Enshan Koh authored at least 18 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

A quantum tug of war between randomness and symmetries on homogeneous spaces.

Rahul Arvind, Kishor Bharti, Jun Yong Khoo, Dax Enshan Koh, Jian Feng Kong

CoRR, 2023

Pseudorandom unitaries are neither real nor sparse nor noise-robust.

Tobias Haug, Kishor Bharti, Dax Enshan Koh

CoRR, 2023

2022

Classical Shadows With Noise.

Dax Enshan Koh, Sabee Grewal

Quantum, 2022

Connecting geometry and performance of two-qubit parameterized quantum circuits.

Amara Katabarwa, Sukin Sim, Dax Enshan Koh, Pierre-Luc Dallaire-Demers

Quantum, 2022

Wasserstein Complexity of Quantum Circuits.

Lu Li, Kaifeng Bu, Dax Enshan Koh, Arthur Jaffe, Seth Lloyd

CoRR, 2022

Complexity of quantum circuits via sensitivity, magic, and coherence.

Kaifeng Bu, Roy J. Garcia, Arthur Jaffe, Dax Enshan Koh, Lu Li

CoRR, 2022

2021

Effects of quantum resources on the statistical complexity of quantum circuits.

Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo, Yaobo Zhang

CoRR, 2021

On the statistical complexity of quantum circuits.

Kaifeng Bu, Dax Enshan Koh, Lu Li, Qingxian Luo, Yaobo Zhang

CoRR, 2021

2020

How many qubits are needed for quantum computational supremacy?

Alexander M. Dalzell, Aram Wettroth Harrow, Dax Enshan Koh, Rolando L. La Placa

Quantum, 2020

2019

Efficient classical simulation of Clifford circuits with nonstabilizer input states.

Kaifeng Bu, Dax Enshan Koh

CoRR, 2019

2018

Quantum Supremacy Lower Bounds by Entanglement Scaling.

Jacob D. Biamonte, Mauro E. S. Morales, Dax Enshan Koh

CoRR, 2018

Complexity Classification of Conjugated Clifford Circuits.

Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh

Proceedings of the 33rd Computational Complexity Conference, 2018

2017

Computing quopit Clifford circuit amplitudes by the sum-over-paths technique.

Dax Enshan Koh, Mark D. Penney, Robert W. Spekkens

Quantum Inf. Comput., 2017

Further extensions of Clifford circuits and their classical simulation complexities.

Dax Enshan Koh

Quantum Inf. Comput., 2017

Quantum Advantage from Conjugated Clifford Circuits.

Adam Bouland, Joseph F. Fitzsimons, Dax Enshan Koh

CoRR, 2017

Quantum simulation from the bottom up: the case of rebits.

Dax Enshan Koh, Murphy Yuezhen Niu, Theodore J. Yoder

CoRR, 2017

2016

Doubly infinite separation of quantum information and communication.

Zi-Wen Liu, Christopher Perry, Yechao Zhu, Dax Enshan Koh, Scott Aaronson

Electron. Colloquium Comput. Complex., 2016

2012

The Effects of Free Will on Randomness Expansion.

Dax Enshan Koh, Michael J. W. Hall, Setiawan, James E. Pope, Artur Ekert, Alastair Kay, Valerio Scarani

Proceedings of the Theory of Quantum Computation, 2012