Bulletin of the American Physical Society
55th Annual Meeting of the APS Division of Atomic, Molecular and Optical Physics
Monday–Friday, June 3–7, 2024; Fort Worth, Texas
Session R11: V: Computer Algorithms to Advance Quantum TechnologyVirtual Only
|
Hide Abstracts |
|
Chair: Debadarshini Mishra, University of Connecticut Room: Virtual Room 1 |
|
Thursday, June 6, 2024 2:00PM - 2:12PM |
R11.00001: Investigating Training Dynamics of Quantum Generative Adversarial Networks Renuka Rajapakse, McCord M Murray The recent advent of Quantum Generative Adversarial Networks (QGANs) has marked a significant milestone in the integration of quantum computing with deep learning. QuGANs, with their reduced parameter sets and quantum-state-based gradients, offer a promising solution to some of the traditional limitations faced by classical GANs, such as computational intensity and mode collapse. This work focuses on investigating the training dynamics of the discriminator within the QGAN framework, a component critical to the overall performance yet challenging in terms of training stability and efficiency. Additionally, I provide insights into the practical aspects of QGAN implementation, including training duration and computational resources, which are often overlooked in theoretical models. |
|
Thursday, June 6, 2024 2:12PM - 2:24PM |
R11.00002: A Quantum-Classical Hybrid Algorithm for Solving Satisfiability Problems Renuka Rajapakse, Daniel Pierce We design and test a hybrid algorithm to solve Boolean Satisfiability Problems (SAT). SAT problems are NP-complete and the algorithms used to solve them require exponential time at worst case. A quadratic speedup over classical algorithms can be obtained by using Quantu Amplitude Amplification. The algorithm we consider is built with IBM Quantum lab and Qiskit. |
|
Thursday, June 6, 2024 2:24PM - 2:36PM |
R11.00003: Applications of Quantum Machine Learning (QML) for Quantum Simulation Renuka Rajapakse, Daniel Vazquez In recent years, machine learning has revolutionized data analysis, extrapolation, and simulation capabilities. However, many of these classical simulation techniques face significant challenges when applied to quantum mechanical systems, primarily due to their complexity and high dimensionality. Traditionally, these methods often require the use of approximations or simplifications in order to be completely functional. Quantum computation provides a more suitable foundation for representing these systems, offering algorithmic increases in speed and efficiency for specific tasks. Leveraging this feature set, quantum machine learning models can be developed without the limitations inherent in classical analogs, significantly enhancing the potential efficiency and accuracy of certain simulations. |
|
Thursday, June 6, 2024 2:36PM - 2:48PM |
R11.00004: Machine learning for efficient generation of universal photonic quantum computing resources Amanuel Anteneh, Léandre Brunel, Olivier R Pfister We present numerical results from simulations using deep reinforcement learning to control a measurement-based quantum processor—a time-multiplexed optical circuit sampled by photon-number-resolving detection—and find it generates squeezed cat states quasi-deterministically, with an average success rate of 98%, far outperforming all other proposals. Since squeezed cat states are deterministic precursors to the Gottesman-Kitaev-Preskill (GKP) bosonic error code, this is a key result for enabling fault tolerant photonic quantum computing. |
|
Thursday, June 6, 2024 2:48PM - 3:00PM |
R11.00005: Pattern-based Functional Testing of Quantum Memories Erik Weiss, Daniel Braun, Marcel Cech, Stanislaw M Soltan With the growing number of qubits of quantum information processing devices, the task of fully characterizing these chips becomes increasingly unfeasible. From a practical perspective, one wants to find possible errors in the functioning of the device in as short time as possible, or otherwise establish its correct functioning with high confidence. In response to these challenges, we propose a pattern-based approach inspired by classical memory testing algorithms to evaluate the functionality of a quantum memory, based on plausible failure mechanisms. We demonstrate the method's capability to extract important qubit characteristics, such as T1 and T2 times, and to identify and analyse interactions between adjacent qubits. Additionally, our approach enables the recognition of different types of crosstalk effects and the detection of signatures indicating non-Markovian dynamics in individual qubits. |
|
Thursday, June 6, 2024 3:00PM - 3:12PM |
R11.00006: Generation of entanglement via single-qubit rotation in torn Hilbert space Zhihao Chi, Tao Zhang We present an efficient and simple protocol for generating arbitrary symmetric entangled states in a torn Hilbert space using only global single-qubit rotations. |
Follow Us |
Engage
Become an APS Member |
My APS
Renew Membership |
Information for |
About APSThe American Physical Society (APS) is a non-profit membership organization working to advance the knowledge of physics. |
© 2026 American Physical Society
| All rights reserved | Terms of Use
| Contact Us
Headquarters
1 Physics Ellipse, College Park, MD 20740-3844
(301) 209-3200
Editorial Office
100 Motor Pkwy, Suite 110, Hauppauge, NY 11788
(631) 591-4000
Office of Public Affairs
529 14th St NW, Suite 1050, Washington, D.C. 20045-2001
(202) 662-8700
