arXiv subjects

Leong-Chuan Kwek

Publications and source records attributed to Leong-Chuan Kwek.

At least 55 records · Page 3Linked to original sources

arXiv2022

Self-Testing of a Single Quantum System: Theory and Experiment

Certifying individual quantum devices with minimal assumptions is crucial for the development of quantum technologies. Here, we investigate how to leverage single-system contextuality to realize self-testing. We develop a robust self-testing protocol based on the simplest contextuality witness for the simplest contextual quantum system, the Klyachko-Can-Binicioğlu-Shumovsky (KCBS) inequality for the qutrit. We establish a lower bound on the fidelity of the state and the measurements (to an ideal configuration) as a function of the value of the witness under a pragmatic assumption on the measurements we call the KCBS orthogonality condition. We apply the method in an experiment with randomly chosen measurements on a single trapped $^{40}{\rm Ca}^+$ and near-perfect detection efficiency. The observed statistics allow us to self-test the system and provide the first experimental demonstration of quantum self-testing of a single system. Further, we quantify and report that deviations from our assumptions are minimal, an aspect previously overlooked by contextuality experiments.

quant-ph↗

arXiv2022

Stability and Dynamics of Many-Body Localized Systems Coupled to Small Bath

It is known that strong disorder in closed quantum systems leads to many-body localization (MBL), and that this quantum phase can be destroyed by coupling to an infinitely large Markovian environment. However, the stability of the MBL phase is less clear when the system and environment are of finite and comparable size. Here, we study the stability and eventual localization properties of a disordered Heisenberg spin chain coupled to a finite environment, and extensively explore the effects of environment disorder, geometry, initial state and system-bath coupling strength. By studying the non-equilibrium dynamics and the eventual steady-state properties of different initial states, our numerical results indicate that in most cases, the system retains its localization properties despite the coupling to the finite environment, albeit to a reduced extent. However, in cases where the system and environment is strongly coupled in the ladder configuration, the eventual localization properties are highly dependent on the initial state, and could lead to either thermalization or localization.

cond-mat.dis-nn↗

arXiv2022

Persistent Current of SU(N) Fermions

We study the persistent current in a system of SU($N$) fermions with repulsive interaction confined in a ring-shaped potential and pierced by an effective magnetic flux. By applying a combination of Bethe ansatz and numerical analysis, we demonstrate that, as a combined effect of spin correlations, interactions and applied flux a specific phenomenon can occur in the system: spinon creation in the ground state. As a consequence, peculiar features in the persistent current arise. The elementary flux quantum, which fixes the persistent current periodicity, is observed to evolve from a single particle one to an extreme case of fractional flux quantum, in which one quantum is shared by all the particles. We show that the persistent current depends on the number of spin components $N$, number of particles and interaction in a specific way that in certain physical regimes has universality traits. At integer filling fractions, the persistent current is suppressed above a threshold of the repulsive interaction by the Mott spectral gap. Despite its mesoscopic nature, the current displays a clear finite size scaling behavior. Specific parity effects in the persistent current landscape hold.

cond-mat.quant-gas↗

arXiv2021

Noisy intermediate-scale quantum (NISQ) algorithms

A universal fault-tolerant quantum computer that can solve efficiently problems such as integer factorization and unstructured database search requires millions of qubits with low error rates and long coherence times. While the experimental advancement towards realizing such devices will potentially take decades of research, noisy intermediate-scale quantum (NISQ) computers already exist. These computers are composed of hundreds of noisy qubits, i.e. qubits that are not error-corrected, and therefore perform imperfect operations in a limited coherence time. In the search for quantum advantage with these devices, algorithms have been proposed for applications in various disciplines spanning physics, machine learning, quantum chemistry and combinatorial optimization. The goal of such algorithms is to leverage the limited available resources to perform classically challenging tasks. In this review, we provide a thorough summary of NISQ computational paradigms and algorithms. We discuss the key structure of these algorithms, their limitations, and advantages. We additionally provide a comprehensive overview of various benchmarking and software tools useful for programming and testing NISQ devices.

quant-ph↗

arXiv2021

Robust Semi-Device Independent Certification of All Pure Bipartite Maximally Entangled States via Quantum Steering

The idea of self-testing is to render guarantees concerning the inner workings of a device based on the measurement statistics. It is one of the most formidable quantum certification and benchmarking schemes. Recently it was shown by Coladangelo et. al. (Nat Commun 8, 15485 (2017)) that all pure bipartite entangled states can be self tested in the device independent scenario by employing subspace methods introduced by Yang et. al. (Phys. Rev. A 87, 050102(R)). Here, we have adapted their method to show that any bipartite pure entangled state can be certified in the semi-device independent scenario through Quantum Steering. Analogous to the tilted CHSH inequality, we use a steering inequality called Tilted Steering Inequality for certifying any pure two-qubit entangled state. Further, we use this inequality to certify any bipartite pure entangled state by certifying two-dimensional sub-spaces of the qudit state by observing the structure of the set of assemblages obtained on the trusted side after measurements are made on the un-trusted side. As a feature of quantum state certification via steering, we use the notion of Assemblage based robust state certification to provide robustness bounds for the certification result in the case of pure maximally entangled states of any local dimension.

quant-ph↗

arXiv2021

GHZ-like states in the Qubit-Qudit Rabi Model

We study a Rabi type Hamiltonian system in which a qubit and a d-level quantum system (qudit) are coupled through a common resonator. In the weak and strong coupling limits the spectrum is analysed through suitable perturbative schemes. The analysis show that the presence of the multilevels of the qudit effectively enhance the qubit-qudit interaction. The ground state of the strongly coupled system is a found of Greenberger-Horne-Zeilinger (GHZ) type. Therefore, despite the qubit-qudit strong coupling, the nature of the specific tripartite entanglement of the GHZ state suppress the bipartite entanglement. We analyze the system dynamics under quenching and adiabatic switching of the qubit-resonator and qudit-resonator couplings. In the quench case, we found that the non-adiabatic generations of photons in the resonator is enhanced by the number of levels in the qudit. The adiabatic control represents a possible route for preparation of GHZ states. Our analysis provides relevant information for future studies on coherent state transfer in qubit-qudit systems.

quant-ph↗

arXiv2021

Graph-Theoretic Framework for Self-Testing in Bell Scenarios

Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely, with minimal assumptions about the underlying quantum system. It is based on the observation that some extremal points in the set of quantum correlations can only be achieved, up to isometries, with specific states and measurements. Here, we present a new approach for quantum self-testing in Bell non-locality scenarios, motivated by the following observation: the quantum maximum of a given Bell inequality is, in general, difficult to characterize. However, it is strictly contained in an easy-to-characterize set: the \emph{theta body} of a vertex-weighted induced subgraph $(G,w)$ of the graph in which vertices represent the events and edges join mutually exclusive events. This implies that, for the cases where the quantum maximum and the maximum within the theta body (known as the Lovász theta number) of $(G,w)$ coincide, self-testing can be demonstrated by just proving self-testability with the theta body of $G$. This graph-theoretic framework allows us to (i) recover the self-testability of several quantum correlations that are known to permit self-testing (like those violating the Clauser-Horne-Shimony-Holt (CHSH) and three-party Mermin Bell inequalities for projective measurements of arbitrary rank, and chained Bell inequalities for rank-one projective measurements), (ii) prove the self-testability of quantum correlations that were not known using existing self-testing techniques (e.g., those violating the Abner Shimony Bell inequality for rank-one projective measurements). Additionally, the analysis of the chained Bell inequalities gives us a closed-form expression of the Lovász theta number for a family of well-studied graphs known as the Möbius ladders, which might be of independent interest in the community of discrete mathematics.

quant-ph↗

arXiv2021

Machine learning engineering of quantum currents

The design, accurate preparation and manipulation of quantum states in quantum circuits are essential operational tasks at the heart of quantum technologies. Nowadays, circuits can be designed with physical parameters that can be controlled with unprecedented accuracy and flexibility. However, the generation of well-controlled current states is still a nagging bottleneck, especially when different circuit elements are integrated together. In this work, we show how machine learning can effectively address this challenge and outperform the current existing methods. To this end, we exploit deep reinforcement learning to prepare prescribed quantum current states in circuits composed of lumped elements. To highlight our method, we show how to engineer bosonic persistent currents as they are relevant in different quantum technologies as cold atoms and superconducting circuits. We demonstrate the use of deep reinforcement learning to re-discover established protocols, as well as solve configurations that are difficult to treat with other methods. With our approach, quantum current states characterised by a single winding number or entangled currents of multiple winding numbers can be prepared in a robust manner, superseding the existing protocols.

quant-ph↗

arXiv2021

Optical properties of a waveguide-mediated chain of randomly positioned atoms

We theoretically study the optical properties of an ensemble of two-level atoms coupled to a one-dimensional waveguide. In our model, the atoms are randomly located in the lattice sites along the one-dimensional waveguide. The results reveal that the optical transport properties of the atomic ensemble are influenced by the lattice constant and the filling factor of the lattice sites. We also focus on the atomic mirror configuration and quantify the effect of the inhomogeneous broadening in atomic resonant transition on the scattering spectrum. Furthermore, we find that initial bunching and persistent quantum beats appear in photon-photon correlation function of the transmitted field, which are significantly changed by filling factor of the lattice sites. With great progress to interface quantum emitters with nanophotonics, our results should be experimentally realizable in the near future.

quant-ph↗

arXiv2020

Low-cost Fredkin gate with auxiliary space

Effective quantum information processing is tantamount in part to the minimization the quantum resources needed by quantum logic gates. Here, we propose an optimization of an n-controlled-qubit Fredkin gate with a maximum of 2n+1 two-qubit gates and 2n single-qudit gates by exploiting auxiliary Hilbert spaces. The number of logic gates required improves on earlier results on simulating arbitrary n-qubit Fredkin gates. In particular, the optimal result for one-controlled-qubit Fredkin gate (which requires three qutrit-qubit partial-swap gates) breaks the theoretical nonconstructive lower bound of five two-qubit gates. Furthermore, using an additional spatial-mode degree of freedom, we design a possible architecture to implement a polarization-encoded Fredkin gate with linear optical elements.

quant-ph↗

arXiv2020

Efficient Fusion of Photonic W-states with Nonunitary Partial-swap Gates

We introduce a nonunitary partial-swap gate for fusing arbitrary small-sized photonic W-states into a large-scale entangled network of W-state efficiently without ancillary photons. A partial-swap gate is designed in an optical architecture based on linear optics elements. By introducing auxiliary degree of freedom, this gate provides a higher success probability with less cost. Our implementation can create a larger target state with a simpler set-up than previous proposals for W-state fusion. Also all "garbage" states are recyclable, i.e., there is no complete failure output in our scheme in principle.

quant-ph↗

arXiv2020

Graph-theoretic approach to dimension witnessing

A fundamental problem in quantum computation and quantum information is finding the minimum quantum dimension needed for a task. For tasks involving state preparation and measurements, this problem can be addressed using only the input-output correlations. This has been applied to Bell, prepare-and-measure, and Kochen-Specker contextuality scenarios. Here, we introduce a novel approach to quantum dimension witnessing for scenarios with one preparation and several measurements, which uses the graphs of mutual exclusivity between sets of measurement events. We present the concepts and tools needed for graph-theoretic quantum dimension witnessing and illustrate their use by identifying novel quantum dimension witnesses, including a family that can certify arbitrarily high quantum dimensions with few events.

quant-ph↗

arXiv2020

Optimal Probes for Global Quantum Thermometry

Quantum thermodynamics has emerged as a separate sub-discipline, revising the concepts and laws of thermodynamics, at the quantum scale. In particular, there has been a disruptive shift in the way thermometry, and thermometers are perceived and designed. Currently, we face two major challenges in quantum thermometry. First, all of the existing optimally precise temperature probes are local, meaning their operation is optimal only for a narrow range of temperatures. Second, aforesaid optimal local probes mandate complex energy spectrum with immense degeneracy, rendering them impractical. Here, we address these challenges by formalizing the notion of global thermometry leading to the development of optimal temperature sensors over a wide range of temperatures. We observe the emergence of different phases for such optimal probes as the temperature interval is increased. In addition, we show how the best approximation of optimal global probes can be realized in spin chains, implementable in ion traps and quantum dots.

quant-ph↗

arXiv2020

Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes

Fault-tolerant quantum computation (FTQC) schemes using large block codes that encode $k>1$ qubits in $n$ physical qubits can potentially reduce the resource overhead to a great extent because of their high encoding rate. However, the fault-tolerant (FT) logical operations for the encoded qubits are difficult to find and implement, which usually takes not only a very large resource overhead but also long $\textit{in-situ}$ computation time. In this paper, we focus on Calderbank-Shor-Steane $[\![ n,k,d ]\!]$ (CSS) codes and their logical FT Clifford circuits. We show that the depth of an arbitrary logical Clifford circuit can be implemented fault-tolerantly in $O(1)$ steps \emph{in-situ} via either Knill or Steane syndrome measurement circuit, with the qualified ancilla states efficiently prepared. Particularly, for those codes satisfying $k/n\sim Θ(1)$, the resource scaling for Clifford circuits implementation on the logical level can be the same as on the physical level up to a constant, which is independent of code distance $d$. With a suitable pipeline to produce ancilla states, our scheme requires only a modest resource cost in physical qubits, physical gates, and computation time for very large scale FTQC.

quant-ph↗

arXiv2020

Generalized Measure of Quantum synchronization

We present a generalized information-theoretic measure of synchronization in quantum systems. This measure is applicable to dynamics of anharmonic oscillators, few-level atoms, and coupled oscillator networks. Furthermore, the new measure allows us to discuss synchronization of disparate physical systems such as coupled hybrid quantum systems and coupled systems undergoing mutual synchronization that are also driven locally. In many cases of interest, we find a closed-form expression for the proposed measure.

quant-ph↗

arXiv2020

Machine Learning meets Quantum Foundations: A Brief Survey

The goal of machine learning is to facilitate a computer to execute a specific task without explicit instruction by an external party. Quantum foundations seeks to explain the conceptual and mathematical edifice of quantum theory. Recently, ideas from machine learning have successfully been applied to different problems in quantum foundations. Here, we compile the representative works done so far at the interface of machine learning and quantum foundations. We conclude the survey with potential future directions.

quant-ph↗

arXiv2020

Classifying global state preparation via deep reinforcement learning

Quantum information processing often requires the preparation of arbitrary quantum states, such as all the states on the Bloch sphere for two-level systems. While numerical optimization can prepare individual target states, they lack the ability to find general solutions that work for a large class of states in more complicated quantum systems. Here, we demonstrate global quantum control by preparing a continuous set of states with deep reinforcement learning. The protocols are represented using neural networks, which automatically groups the protocols into similar types, which could be useful for finding classes of protocols and extracting physical insights. As application, we generate arbitrary superposition states for the electron spin in complex multi-level nitrogen-vacancy centers, revealing classes of protocols characterized by specific preparation timescales. Our method could help improve control of near-term quantum computers, quantum sensing devices and quantum simulations.

quant-ph↗

arXiv2020

Long-distance dissipation-assisted transport of entangled states via a chiral waveguide

Quantum networks provide a prominent platform for realizing quantum information processing and quantum communication, with entanglement being a key resource in such applications. Here, we describe the dissipative transport protocol for entangled states, where entanglement stored in the first node of quantum network can be transported with high fidelity to the second node via a 1D chiral waveguide. In particular, we exploit the directional asymmetry in chirally-coupled single-mode ring resonators to transport entangled states. For the fully chiral waveguide, Bell states, multipartite $W$-states and and Dicke states can be transported with fidelity as high as $0.954$, despite the fact that the communication channel is noisy. Our proposal can be utilized for long-distance distribution of multipartite entangled states between the quantum nodes of the open quantum network.

quant-ph↗