Lia Yeh

Lia Yeh

Auto-generated profile, based on publicly available information

Lia Yeh

University of Oxford

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2022 in Optical Engineering
Verified
Journal Article
Open access
PDF file
ZSZeki C. Seskir
Zeki C. Seskir
PMPiotr Migdał
Piotr Migdał
CWCarrie Weidner
Carrie Weidner
AAAditya Anupam
Aditya Anupam
NCNicky Case
Nicky Case
Maria Luisa ChiofaloMaria Luisa Chiofalo
Maria Luisa Chiofalo
The second quantum revolution1 has been unfolding for over two decades, and numerous countries across the globe acknowledge the potential of these technologies. In the last decade, more than 15 publicly supported national initiatives were launched, with several of them having budgets exceeding billion euros, particularly in the UK,2 the US,3 the EU,4 France,5 Germany,6 India,7 and China.8 Both the number of new publications per year9 and the number of patents10 granted on quantum technologies (QT) have been climbing steadily for the last decade, along with the growing number of start-ups and renowned companies getting into the field. Recently, the field has been receiving attention from private funding sources, which some have been referring to as the ‘quantum gold rush.’11 Within two decades, QT has advanced from a topic that was mainly discussed in physics conferences to becoming a strong contender for a potential future industry.


28 May 2019 in The Journal of Chemical Physics
Verified
Journal Article
Open access
PDF file
LYLia Yeh
Lia Yeh
LSLincoln Satterthwaite
Lincoln Satterthwaite
DPDavid Patterson
David Patterson
We present a new algorithm, Robust Automated Assignment of Rigid Rotors (RAARR), for assigning rotational spectra of asymmetric tops. The RAARR algorithm can automatically assign experimental spectra under a broad range of conditions, including spectra comprised of multiple mixture components, in ≲100 s. The RAARR algorithm exploits constraints placed by the conservation of energy to find sets of connected lines in an unassigned spectrum. The highly constrained structure of these sets eliminates all but a handful of plausible assignments for a given set, greatly reducing the number of potential assignments that must be evaluated. We successfully apply our algorithm to automatically assign 15 experimental spectra, including 5 previously unassigned species, without prior estimation of molecular rotational constants. In 9 of the 15 cases, the RAARR algorithm successfully assigns two or more mixture components.

13 March 2023
Verified
Conference Paper
Open access
LYLia Yeh
Lia Yeh
We identify a novel qudit gate which we refer to as the gate. This is an alternate generalization of the qutrit T gate to any odd prime dimension d, in the dth level of the Clifford hierarchy. Using this gate which is efficiently realizable fault-tolerantly should a certain conjecture hold, we deterministically construct in the Clifford+ gate set, d-qubit W states in the qudit {|0⟩, |1⟩} subspace. For qutrits, we show deterministic and fault-tolerant constructions for the three-qubit W state with T count three, for the six-qubit W state, and for any power-of-three-qubit W state. Furthermore, we adapt these constructions to recursively scale the W state size to arbitrary size N, in O(N) gate count and O(log N) depth. This is moreover deterministic for any size qubit W state, and for any prime d-dimensional qudit W state, size a power of d. For these purposes, we devise constructions of the |0⟩ -controlled Pauli X gate and the controlled Hadamard gate in any prime qudit dimension. These decompositions, for which exact synthesis is unknown in Clifford+T for d > 3, may be of independent interest.

10 August 2024 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
AGAndrew N. Glaudell
Andrew N. Glaudell
NRNeil J. Ross
Neil J. Ross
JWJohn van de Wetering
John van de Wetering
LYLia Yeh
Lia Yeh
It is known that the matrices that can be exactly represented by a multiqubit circuit over the Tof-foli+Hadamard, Clifford+T , or, more generally, Clifford-cyclotomic gate set are precisely the unitary matrices with entries in the ring Z[1/2, ζ k ], where k is a positive integer that depends on the gate set and ζ k is a primitive 2 k-th root of unity. In the present paper, we establish an analogous correspondence for qutrits. We define the multiqutrit Clifford-cyclotomic gate set of degree 3 k by extending the classical qutrit gates X, CX, and CCX with the Hadamard gate H and the T k gate T k = diag(1, ω k , ω 2 k), where ω k is a primitive 3 k-th root of unity. This gate set is equivalent to the qutrit Toffoli+Hadamard gate set when k = 1, and to the qutrit Clifford+T k gate set when k > 1. We then prove that a 3 n × 3 n unitary matrix U can be represented by an n-qutrit circuit over the Clifford-cyclotomic gate set of degree 3 k if and only if the entries of U lie in the ring Z[1/3, ω k ].

15 November 2023 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
PDF file
JWJohn van de Wetering
John van de Wetering
LYLia Yeh
Lia Yeh
Phase gadgets have proved to be an indispensable tool for reasoning about ZX-diagrams, being used in optimisation and simulation of quantum circuits and the theory of measurement-based quantum computation. In this paper we study phase gadgets for qutrits. We present the flexsymmetric variant of the original qutrit ZX-calculus, which allows for rewriting that is closer in spirit to the original (qubit) ZX-calculus. In this calculus phase gadgets look as you would expect, but there are non-trivial differences in their properties. We devise new qutrit-specific tricks to extend the graphical Fourier theory of qubits, resulting in a translation between the 'additive' phase gadgets and a 'multiplicative' counterpart we dub phase multipliers. This enables us to generalise the qubit notion of multiple-control to qutrits in two ways. The first type is controlling on a single tritstring, while the second type applies the gate a number of times equal to the tritwise multiplication modulo 3 of the control qutrits. We show how both types of control can be implemented for any qutrit Z or X phase gate, ancilla-free, and using only Clifford and phase gates. The first requires a polynomial number of gates and exponentially small phases, while the second requires an exponential number of gates, but constant sized phases. This is interesting, because such a construction is not possible in the qubit setting. As an application of these results we find a construction for emulating arbitrary qubit diagonal unitaries, and specifically find an ancilla-free emulation for the qubit CCZ gate that only requires three single-qutrit non-Clifford gates-provably lower than the four T gates needed for qubits with ancilla.