Bulletin of the American Physical Society
APS March Meeting 2022
Volume 67, Number 3
Monday–Friday, March 14–18, 2022; Chicago
Session G37: Towards Fault-Tolerant Quantum Computing ArchitecturesFocus Recordings Available
|
Hide Abstracts |
Sponsoring Units: DQI Chair: Kenneth Brown, Duke Room: McCormick Place W-194B |
Tuesday, March 15, 2022 11:30AM - 11:42AM |
G37.00001: Entanglement purification and protection in a superconducting quantum network Haoxiong Yan, Youpeng Zhong, Hung-Shen Chang, Ming-Han Chou, Christopher R Conner, Joel Grebel, Rhys G Povey, Audrey Bienfait, Etienne Dumur, Andrew N Cleland High-fidelity quantum entanglement is a key resource for quantum communication and distributed quantum computing, enabling quantum state teleportation, dense coding, and quantum encryption. Any sources of decoherence in the communication channel however degrade entanglement fidelity, thereby increasing the error rates of entangled state protocols. Entanglement purification provides a method to alleviate these non-idealities, by distilling impure states into higher-fidelity entangled states. Here we demonstrate the entanglement purification of Bell pairs shared between two remote superconducting quantum nodes connected by a moderately lossy, 1-meter long superconducting communication cable. We use a purification process to correct the dominant amplitude damping errors caused by transmission through the cable, with fractional increases in fidelity as large as 25%, achieved for higher damping errors. The best final fidelity the purification achieves is 94.09±0.98%. In addition, we use both dynamical decoupling and Rabi driving to protect the entangled states from local noise, increasing the effective qubit dephasing time by a factor of four, from 3 μs to 12 μs. These methods demonstrate the potential for the generation and preservation of very high-fidelity entanglement in a superconducting quantum communication network. |
Tuesday, March 15, 2022 11:42AM - 11:54AM |
G37.00002: Gate-Set Exploration using High-Quality Numerical Synthesis Marc Davis, Costin C Iancu, Ethan H Smith, Ed Younis We analyze and compare the performance of various proposed hardware-level two-qubit quantum gates. We have chosen gates that are actively being used by hardware quantum, or have been proposed as plausible gates that can be implemented in hardware. Comparison is done by synthesizing a set of benchmark unitaries with a high-quality and gateset-independent synthesis algorithm, and comparing the synthesized circuits in terms of length (adjusted estimated gate runtime and fidelity) and simulated or measured gate error. The set of two-qubit gates we consider consists of CNOT, sqrt(CNOT), iSWAP, sqrt(iSWAP), and Molmer-Sorensen. We also consider the XX and CRz gates with parameterized angles, gatesets that include two hardware-implemented two-qubit gates, and the CNOT and CSUM gates as two-qutrit gates. We then analyze and compare our results, and offer suggestions for potential hardware-level gatesets that offer improved performance over the commonly used gatesets that rely on either CNOT or Molmer-Sorensen. |
Tuesday, March 15, 2022 11:54AM - 12:06PM |
G37.00003: Design and simulation of a fluxonium-based quantum processor Trevor Chistolini, Long B Nguyen, Gerwin Koolstra, Yosep Kim, Larry Chen, Ravi K Naik, Alexis Morvan, Zahra Pedramrazi, Christian Juenger, John Mark Kreikebaum, David I Santiago, Irfan Siddiqi In recent years, quantum processors using superconducting circuits have scaled up to the tens of qubits to explore complex physical phenomena and execute novel algorithms [1]. The fluxonium qubit is a superconducting circuit architecture that has achieved impressive coherence times [2]. Its high anharmonicity enables high fidelity gates with low leakage, promising better quantum processing performance. Here, we report our progress on designing and simulating a quantum processor based on fluxonium qubits with suppressed crosstalk, verifying that the parameters are within our fabrication capabilities. We discuss challenges in scaling up and our approaches to overcome them. |
Tuesday, March 15, 2022 12:06PM - 12:18PM |
G37.00004: Near-deterministic generation of photonic graph states through hybrid strategies using a realistic quantum emitter and linear optics Paul Hilaire, Leonid Vidro, Edwin Barnes, Sophia Economou, Hagai Eisenberg We propose near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities. We introduce a hybridized protocol based on both quantum-emitter-based graph state generation and linear-optics fusion gates to produce graph states of complex topology near-deterministically. Our results should pave the way towards the practical implementation of both resource-efficient measurement-based quantum communication and computing. |
Tuesday, March 15, 2022 12:18PM - 12:30PM |
G37.00005: SupermarQ: A Scalable Quantum Benchmark Suite Victory T Omole The emergence of quantum computers as a new computational paradigm has been accompanied by speculation concerning the scope and timeline of their anticipated revolutionary changes. While quantum computing is still in its infancy, the variety of different architectures used to implement quantum computations make it difficult to reliably measure and compare performance. This problem motivates our introduction of SupermarQ, a scalable, hardware-agnostic quantum benchmark suite which uses application-level metrics to measure performance. SupermarQ is the first attempt to systematically apply techniques from classical benchmarking methodology to the quantum domain. We define a set of feature vectors to quantify the suite's coverage and select applications from a variety of domains to ensure the suite is representative of real workloads. We collect benchmark results from the IBM, IonQ, and platforms. We envision that quantum benchmarking will be a large cross-community effort built on open source, constantly evolving benchmark suites. We introduce SupermarQ as an important step in this direction. |
Tuesday, March 15, 2022 12:30PM - 12:42PM |
G37.00006: Entanglement concentration of weighted graph states Rafail Frantzeskakis, Chenxu Liu, Zahra Raissi, Edwin Barnes, Sophia Economou The creation of graph states is highly demanding because of the experimental error in the required gates. An experimentally relevant scenario is a coherent two-qubit error, which results in a gate with reduced entangling power. This in turn leads to weighted graphs, which contain less entanglement than regular graph states. We propose an entanglement concentration protocol that is capable of generating perfect GHZ states with a few local measurements on weighted graph states. We analyze how our protocol efficiently generates GHZ states and how robust these states are in the presence of noise. |
Tuesday, March 15, 2022 12:42PM - 1:18PM |
G37.00007: Full-stack architectures for fault tolerant quantum computing with photons Invited Speaker: Naomi Nickerson A linear optical approach to quantum computing offers highly coherent qubits, high fidelity single qubit gates, and probabilistic entangling operations that can be implemented using well-known quantum optical methods. The key advantage of photonic quantum computing is the fact that the required photonic chips can be produced in conventional fabrication facilities used for commercial silicon photonics, allowing scaling to achieve large-scale error correction. As a hardware platform for quantum computation linear optics offers unique flexibility in designing architectures for fault tolerant quantum computing. Some interesting examples are the long range connectivity which is straightforward in a photonic architecture, and the ability to move qubits in temporal as well as spatial dimensions. I will discuss how these features impact on designing architectures across the stack, from physical operations, to quantum error correction methods and combining it all into a universal set of logical gates. |
Tuesday, March 15, 2022 1:18PM - 1:30PM |
G37.00008: Accelerating the Timeline for Practical QEC With Highly Configurable Control Platforms - part I Yonatan Cohen, Arthur Strauss, Lior Ella, Nissim Ofek While quantum computers have the potential to solve important problems beyond the reach of any classical technology, error rates pose a great challenge towards the realization of a practical machine. Quantum Error Correction (QEC) codes aim to reduce those error rates by encoding quantum information non-locally through the use of multiple physical qubits and are considered today as one of the most promising paths towards fault-tolerant quantum computation. |
Tuesday, March 15, 2022 1:30PM - 1:42PM |
G37.00009: Accelerating the Timeline for Practical QEC With Highly Configurable Control Platforms II Yonatan Cohen, Lior Ella, Arthur Strauss, Nissim Ofek While quantum computers have the potential to solve important problems beyond the reach of any classical technology, error rates pose a great challenge towards the realization of a practical machine. Quantum Error Correction (QEC) codes aim to reduce those error rates by encoding quantum information non-locally through the use of multiple physical qubits and are considered today as one of the most promising paths towards fault-tolerant quantum computation. |
Tuesday, March 15, 2022 1:42PM - 1:54PM |
G37.00010: Design and analysis of superconducting quantum processors for surface code Nadia Haider, Marc Beekman, Piotr Kaminski, Leonardo DiCarlo We present an effective numerical method to analyze bus-mediated qubit-qubit couplings and two-qubit-gate speed limits in superconducting quantum processors designed for surface-code quantum error correction. Our hybrid simulation tool, combining finite-element and circuit simulation, enables the investigation of a complex chip layout with limited computational resources. We apply the simulation method to the design of Surface-17 and -49 processors, finding good agreement with the experimental realization of Surface-17. |
Tuesday, March 15, 2022 1:54PM - 2:06PM |
G37.00011: Microwave quantum teleportation over a thermal noise channel Michael U Renger, Wun Kwan Yam, Florian Fesquet, Kedar Honasoge, Fabian Kronowetter, Qiming Chen, Yuki Nojiri, Oscar Gargiulo, Achim Marx, Rudolf Gross, Frank Deppe, Kirill G Fedorov In the rapidly growing field of quantum networks, quantum teleportation stands out as a promising protocol to realize efficient and unconditionally secure transfer of quantum states. Quantum teleportation of propagating microwave states has been successfully demonstrated in recent experiments [1] and paves the way towards implementation of quantum microwave networks. For realistic use cases, it is of paramount importance to study resilience of microwave quantum teleportation against environmental imperfections. In this regard, we investigate the thermal noise influence in the feedforward channel on the fidelity of teleported states. Furthermore, we analyze the effect of imperfections in the entangled resource states and derive conditions for successful quantum teleportation. We experimentally verify our predictions by employing quantum microwave teleportation over a 6.5m long cryogenic link, which can be operated in a wide temperature range. |
Tuesday, March 15, 2022 2:06PM - 2:18PM |
G37.00012: Transmon platform for quantum computing challenged by chaotic fluctuations Simon Trebst, Christoph Berke, Evangelos Varvelis, Alexander Altland, David P DiVincenzo From the perspective of many body physics, the transmon qubit architectures currently developed for quantum computing are systems of coupled nonlinear quantum resonators. In practice, one needs to balance intentional disorder / frequency detuning (to protect qubits) and nonlinear resonator couplings (to manipulate qubits) — but with chaos lurking to take over the many-body localized phase, will this be possible? |
Tuesday, March 15, 2022 2:18PM - 2:30PM |
G37.00013: Entropy: A Lab Manager Software That Lowers the Lab Entropy and Boosts Your Productivity Nikola Šibalić, Gal Winer, Tal Shani, Guy Keren Running computations on Quantum processors requires calibration of a growing number of qubits while allowing execution of complex control sequences. This joins a host of additional challenges such as collecting, sorting, and gaining insight into the experimental data records. However, human real-time cognitive processing capacity in the lab remains limited. To scale up, we need to provide a good contextual interface between experimental protocol, results, and narrative. |
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. |
© 2024 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