arXiv subjects

Nhung H. Nguyen

Publications and source records attributed to Nhung H. Nguyen.

16 recordsLinked to original sources

arXiv2026

Identifying defective units in infinite periodic arrays of point sources

This paper focuses on identifying defective units in unbounded periodic arrays of point sources using boundary data. The study is motivated by the noninvasive evaluation of large-scale periodic source systems. Unlike classical inverse source problems in free space, the key challenge here lies in the disruption of periodicity caused by defective sources in the infinite array. To address this, we employ the Floquet - Bloch transform to reformulate the original inverse source problem as a quasi-periodic inverse source problem. We first establish uniqueness theorems for both the original and the quasi-periodic formulations. Then, we develop a new numerical method for identifying defective sources. This method combines a sampling indicator function with an algebraic technique to determine not only the number of defective sources, but also their locations and intensities. Numerical experiments are presented to validate the effectiveness of the proposed method.

math.NA↗

arXiv2025

Observation of quantum-field-theory dynamics on a spin-phonon quantum computer

Simulating out-of-equilibrium dynamics of quantum field theories in nature is challenging with classical methods, but is a promising application for quantum computers. Unfortunately, simulating interacting bosonic fields involves a high boson-to-qubit encoding overhead. Furthermore, when mapping to qubits, the infinite-dimensional Hilbert space of bosons is necessarily truncated, with truncation errors that grow with energy and time. A qubit-based quantum computer, augmented with an active bosonic register, and with qubit, bosonic, and mixed qubit-boson quantum gates, offers a more powerful platform for simulating bosonic theories. We demonstrate this capability experimentally in a hybrid analog-digital trapped-ion quantum computer, where qubits are encoded in the internal states of the ions, and the bosons in the ions' motional states. Specifically, we simulate nonequilibrium dynamics of a (1+1)-dimensional Yukawa model, a simplified model of interacting nucleons and pions, and measure fermion- and boson-occupation-state probabilities. These dynamics populate high bosonic-field excitations starting from an empty state, and the experimental results capture well such high-occupation states. This simulation approaches the regime where classical methods become challenging, bypasses the need for a large qubit overhead, and removes truncation errors. Our results, therefore, open the way to achieving demonstrable quantum advantage in qubit-boson quantum computing.

quant-ph↗

arXiv2023

Bespoke Pulse Design for Robust Rapid Two-Qubit Gates with Trapped Ions

Two-qubit gate performance is vital for scaling up ion-trap quantum computing. Optimized quantum control is needed to achieve reductions in gate-time and gate error-rate. We describe two-qubit gates with addressed Raman beams within a linear trapped-ion chain by a quantum master equation (QME). The QME incorporates the single-ion two-photon effective Rabi frequency, Autler-Townes and vibrational Bloch-Siegert energy shifts, off-resonant transitions, Raman and Rayleigh scattering, laser-power fluctuations, motional heating, cross-Kerr phonon coupling, laser spillover, asymmetric addressing beams and an imperfect initial motional ground state, with no fitting parameters. Whereas state-of-the-art methods are oblivious to these effects in the gate design procedure. We employ global optimization to design pulse sequences for achieving a robust rapid two-qubit gate for seven trapped $^{171}$Yb$^{+}$ ions by optimizing over numerically integrated QME solutions. Here, robust means resilient against slow drift of motional frequencies, and rapid means gate execution where the effective Rabi frequency is comparable to the detuning of the laser from the ion's bare electronic transition. Our robust quantum control delivers rapid high-quality two-qubit gates in long ion chains, enabling scalable quantum computing with trapped ions.

quant-ph↗

arXiv2023

Pairwise-parallel entangling gates on orthogonal modes in a trapped-ion chain

Parallel operations are important for both near-term quantum computers and larger-scale fault-tolerant machines because they reduce execution time and qubit idling. We propose and implement a pairwise-parallel gate scheme on a trapped-ion quantum computer. The gates are driven simultaneously on different sets of orthogonal motional modes of a trapped-ion chain. We demonstrate the utility of this scheme by creating a GHZ state in one step using parallel gates with one overlapping qubit. We also show its advantage for circuits by implementing a digital quantum simulation of the dynamics of an interacting spin system, the transverse-field Ising model. This method effectively extends the available gate depth by up to two times with no overhead apart from additional initial cooling when no overlapping qubit is involved. This is because using a set of extra modes as additional quantum degrees of freedom is nearly equivalent to halving the trap heating rate, doubling the laser and qubit coherence time, and extending the controller memory depth by up to a factor of two. This scheme can be easily applied to different trapped-ion qubits and gate schemes, broadly enhancing the capabilities of trapped-ion quantum computers.

quant-ph↗

arXiv2022

Realizing two-qubit gates through mode engineering on a trapped-ion quantum computer

Two-qubit gates are a fundamental constituent of a quantum computer and typically its most challenging operation. In a trapped-ion quantum computer, this is typically implemented with laser beams which are modulated in amplitude, frequency, phase, or a combination of these. The required modulation becomes increasingly more complex as the quantum computer becomes larger, complicating the control hardware design. Here, we develop a simple method to essentially remove the pulse-modulation complexity by engineering the normal modes of the ion chain. We experimentally demonstrate the required mode engineering in a three ion chain. This opens up the possibility to trade off complexity between the design of the trapping fields and the optical control system, which will help scale the ion trap quantum computing platform.

quant-ph↗

arXiv2022

Quantum computational advantage attested by nonlocal games with the cyclic cluster state

We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a subset of its Pauli stabilizers on a quantum computer is compared to that of classical Boolean circuits with the same, nearest-neighboring gate connectivity. Using a circuit-based trapped-ion quantum computer, we prepare and measure a six-qubit cyclic cluster state with an overall fidelity of 60.6% and 66.4%, before and after correcting for measurement-readout errors, respectively. Our experimental results indicate that while this fidelity readily passes conventional (or depth-0) Bell bounds for local hidden-variable models, it is on the cusp of demonstrating a higher probability of success than what is possible by depth-1 classical circuits. Our games offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the number of qubits available increases.

quant-ph↗

arXiv2022

Para-particle oscillator simulations on a trapped ion quantum computer

Deformed oscillators allow for a generalization of the standard fermions and bosons, namely, for the description of para-particles. Such particles, while indiscernible in nature, can represent good candidates for descriptions of physical phenomena like topological phases of matter. Here, we report the digital quantum simulation of para-particle oscillators by mapping para-particle states to the state of a qubit register, which allow us to identify the para-particle oscillator Hamiltonian as an $XY$ model, and further digitize the system onto a universal set of gates. In both instances, the gate depth grows polynomially with the number of qubits used. To establish the validity of our results, we experimentally simulate the dynamics of para-fermions and para-bosons, demonstrating full control of para-particle oscillators on a quantum computer. Furthermore, we compare the overall performance of the digital simulation of dynamics of the driven para-Fermi oscillator to a recent analog quantum simulation result.

quant-ph↗

arXiv2022

Experimental Measurement of Out-of-Time-Ordered Correlators at Finite Temperature

Out-of-time-ordered correlators (OTOCs) are a key observable in a wide range of interconnected fields including many-body physics, quantum information science, and quantum gravity. Measuring OTOCs using near-term quantum simulators will extend our ability to explore fundamental aspects of these fields and the subtle connections between them. Here, we demonstrate an experimental method to measure OTOCs at finite temperatures and use the method to study their temperature dependence. These measurements are performed on a digital quantum computer running a simulation of the transverse field Ising model. Our flexible method, based on the creation of a thermofield double state, can be extended to other models and enables us to probe the OTOC's temperature-dependent decay rate. Measuring this decay rate opens up the possibility of testing the fundamental temperature-dependent bounds on quantum information scrambling.

quant-ph↗

arXiv2022

Digital Quantum Simulation of the Schwinger Model and Symmetry Protection with Trapped Ions

Tracking the dynamics of physical systems in real time is a prime application of digital quantum computers. Using a trapped-ion system with up to six qubits, we simulate the real-time dynamics of a lattice gauge theory in 1+1 dimensions, i.e., the lattice Schwinger model, and demonstrate non-perturbative effects such as pair creation for times much longer than previously accessible. We study the gate requirement of two formulations of the model using the Suzuki-Trotter product formula, as well as the trade-off between errors from the ordering of the Hamiltonian terms, the Trotter step size, and experimental imperfections. To mitigate experimental errors, a recent symmetry-protection protocol for suppressing coherent errors and a symmetry-inspired post-selection scheme are applied. This work demonstrates the integrated theoretical, algorithmic, and experimental approach that is essential for efficient simulation of lattice gauge theories and other complex physical systems.

quant-ph↗

arXiv2022

Multi-round QAOA and advanced mixers on a trapped-ion quantum computer

Combinatorial optimization problems on graphs have broad applications in science and engineering. The Quantum Approximate Optimization Algorithm (QAOA) is a method to solve these problems on a quantum computer by applying multiple rounds of variational circuits. However, there exist several challenges limiting the real-world applications of QAOA. In this paper, we demonstrate on a trapped-ion quantum computer that QAOA results improve with the number of rounds for multiple problems on several arbitrary graphs. We also demonstrate an advanced mixing Hamiltonian that allows sampling of all optimal solutions with predetermined weights. Our results are a step towards applying quantum algorithms to real-world problems.

quant-ph↗

arXiv2021

Experimental realization of para-particle oscillators

Para-particles are fascinating because they are neither bosons nor fermions. While unlikely to be found in nature, they might represent accurate descriptions of physical phenomena like topological phases of matter. We report the quantum simulation of para-particle oscillators by tailoring the native couplings of two orthogonal motional modes of a trapped ion. Our system reproduces the dynamics of para-bosons and para-fermions of even order very accurately. These results represent the first experimental analogy of para-particle dynamics in any physical system and demonstrate full control of para-particle oscillators.

quant-ph↗

arXiv2021

Cross-Platform Comparison of Arbitrary Quantum Computations

As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform fidelities.

quant-ph↗

arXiv2021

Demonstration of Shor encoding on a trapped-ion quantum computer

Fault-tolerant quantum error correction (QEC) is crucial for unlocking the true power of quantum computers. QEC codes use multiple physical qubits to encode a logical qubit, which is protected against errors at the physical qubit level. Here we use a trapped ion system to experimentally prepare $m$-qubit GHZ states and sample the measurement results to construct $m\times m$ logical states of the $[[m^2,1,m]]$ Shor code, up to $m=7$. The synthetic logical fidelity shows how deeper encoding can compensate for additional gate errors in state preparation for larger logical states. However, the optimal code size depends on the physical error rate and we find that $m=5$ has the best performance in our system. We further realize the direct logical encoding of the $[[9,1,3]]$ Shor code on nine qubits in a thirteen-ion chain for comparison, with $98.8(1)\%$ and $98.5(1)\%$ fidelity for state $\left\vert\pm\right\rangle_L$, respectively.

quant-ph↗

arXiv2021

Efficient, stabilized two-qubit gates on a trapped-ion quantum computer

Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make them robust to drift in experimental parameters, and shorten the gate times. In this paper, we present two methods, one exact and one approximate, to construct optimal pulses for entangling gates on a pair of ions within a trapped ion chain, one of the leading quantum computing architectures. Our methods are direct, non-iterative, and linear, and can construct gate-steering pulses requiring less power than the standard method by more than an order of magnitude in some parameter regimes. The power savings may generally be traded for reduced gate time and greater qubit connectivity. Additionally, our methods provide increased robustness to mode drift. We illustrate these trade-offs on a trapped-ion quantum computer.

quant-ph↗

arXiv2020

Quantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer

The quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.

quant-ph↗

arXiv2019

Noise reduction using past causal cones in variational quantum algorithms

We introduce an approach to improve the accuracy and reduce the sample complexity of near term quantum-classical algorithms. We construct a simpler initial parameterized quantum state, or ansatz, based on the past causal cone of each observable, generally yielding fewer qubits and gates. We implement this protocol on a trapped ion quantum computer and demonstrate improvement in accuracy and time-to-solution at an arbitrary point in the variational search space. We report a $\sim 27\%$ improvement in the accuracy of the calculation of the deuteron binding energy and $\sim 40\%$ improvement in the accuracy of the quantum approximate optimization of the MAXCUT problem applied to the dragon graph $T_{3,2}$. When the time-to-solution is prioritized over accuracy, the former requires $\sim 71\%$ fewer measurements and the latter requires $\sim 78\%$ fewer measurements.

quant-ph↗