6 papers
Time complexity in preparing metrologically useful quantum states
Carla M. Quispe Flores, Raphael Kaubruegger, Minh C. Tran +3
We investigate the fundamental time complexity, as constrained by Lieb-Robinson bounds, for preparing entangled states useful in quantum metrology. We relate the minimum time to th…
High-Distance Error-Correcting Codes for Fermion-to-Qubit Mappings in 2D and 3D
Ruby Wei, Aqua Chung, Luke Coffman +2
Quantum simulation of fermionic systems is a leading application of quantum computers. One promising approach is to represent fermions with qubits via fermion-to-qubit mappings. In…
2D Quon Language: Unifying Framework for Cliffords, Matchgates, and Beyond
Byungmin Kang, Chen Zhao, Zhengwei Liu +2
Simulating generic quantum states and dynamics is practically intractable using classical computers. However, certain special classes -- namely Clifford and matchgate circuits -- p…
High coherence fluxonium manufactured with a wafer-scale uniformity process
Fei Wang, Kannan Lu, Huijuan Zhan +32
Fluxonium qubits are recognized for their high coherence times and high operation fidelities, attributed to their unique design incorporating a superinductor, which is typically im…
Measuring Non-Gaussian Magic in Fermions: Convolution, Entropy, and the Violation of Wick's Theorem and the Matchgate Identity
Luke Coffman, Graeme Smith, Xun Gao
Classically hard to simulate quantum states, or "magic states", are prerequisites to quantum advantage, highlighting an apparent separation between classically and quantumly tracta…
A polynomial-time classical algorithm for noisy quantum circuits
Thomas Schuster, Chao Yin, Xun Gao +1
We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average er…