Hardware-efficient quantum computing using qudits

Published on ● Video Link: https://www.youtube.com/watch?v=fpJxt-Nl-Uk



Duration: 48:24
102 views
4


Christine Muschik (Waterloo)
https://simons.berkeley.edu/talks/christine-muschik-waterloo-2024-04-25
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms

Particle physics underpins our understanding of the world at a fundamental level by describing the interplay of matter and forces through gauge theories. Yet, despite their unmatched success, the intrinsic quantum mechanical nature of gauge theories makes important problem classes notoriously difficult to address with classical computational techniques. A promising way to overcome these roadblocks is offered by quantum computers, which are based on the same laws that make the classical computations so difficult. Here, we present a quantum computation of the properties of the basic building block of two-dimensional lattice quantum electrodynamics, involving both gauge fields and matter. This computation is made possible by the use of a trapped-ion qudit quantum processor, where quantum information is encoded in d different states per ion, rather than in two states as in qubits. Qudits are ideally suited for describing gauge fields, which are naturally high-dimensional, leading to a dramatic reduction in the quantum register size and circuit complexity. Using a variational quantum eigensolver, we find the ground state of the model and observe the interplay between virtual pair creation and quantized magnetic field effects. The qudit approach further allows us to seamlessly observe the effect of different gauge field truncations by controlling the qudit dimension. Our results open the door for hardware-efficient quantum simulations with qudits in near-term quantum devices.




Other Videos By Simons Institute for the Theory of Computing


2024-04-30Evidence for the utility of quantum computing before fault tolerance
2024-04-30High-fidelity and Fault-tolerant Teleportation of a Logical Qubit on a Trapped-ion Quantum Computer
2024-04-30An Overview of Quantum Algorithms
2024-04-30Certifying almost all quantum states with few single-qubit measurements
2024-04-30Learning Shallow Quantum Circuits and Quantum States Prepared by Shallow Circuits in Polynomial Time
2024-04-30A Quantum Speed-Up for Approximating the Top Eigenvector of aMatrix via Improved Tomography
2024-04-30The Virtues of the Quantum Approximate Optimization Algorithm
2024-04-30Continuous-time quantum walks for MAX-CUT are hot
2024-04-30Circuit Conspiracies
2024-04-30Analog quantum machine learning for near-term hardware
2024-04-30Hardware-efficient quantum computing using qudits
2024-04-30Probing the limits of classical computing with arbitrarily connected quantum circuits
2024-04-30Emergence of Universal Randomness in Quantum Many-body Dynamics
2024-04-30Exploring the quantum computing frontier with reconfigurable atom arrays
2024-04-30On Scrambling Times of Quantum Systems, Including Black Holes
2024-04-30From randomized benchmarking to cycle error reconstruction
2024-04-30How to fault-tolerantly realize any quantum circuit with local operations
2024-04-30Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks
2024-04-30QEC demonstrations leveraging dynamic circuits
2024-04-30Scheduling syndrome measurement circuits
2024-04-30Halving the cost of surface codes by running error correction at the logical level



Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms
Christine Muschik