Optimal Quantum Circuit Cuts with Application to Clustered Hamiltonian Simulation by Aram W. Harrow, Angus Lowe

“…We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. …”
Get full text

Quantum Algorithms for the Physical Layer: Potential Applications to Physical Layer Security by Toshiki Matsumine, Hideki Ochiai, Junji Shikata

“…Meanwhile, as an alternative to cryptographic methods, physical layer security (PLS) has been extensively studied as a means to realize secure wireless communication that is resistant to attacks by both classical and quantum computers, i.e., quantum-safe. While the prevailing approach to PLS has been based on classical algorithms, this could potentially be accelerated by the application of quantum algorithms. …”
Get full text

Tantalum airbridges for scalable superconducting quantum processors by Kunliang Bu, Sainan Huai, Zhenxing Zhang, Dengfeng Li, Yuan Li, Jingjing Hu, Xiaopei Yang, Maochun Dai, Tianqi Cai, Yi-Cong Zheng, Shengyu Zhang

“…Additionally, the experimental achievement of airbridge coupling with a controlled-Z gate fidelity surpassing 99.2(2)% in a separate two-qubit quantum chip may facilitate scalable quantum computation and quantum error correction with entirely tantalum elements.…”
Get full text

Dynamical suppression of many-body non-Hermitian skin effect in anyonic systems by Yi Qin, Ching Hua Lee, Linhu Li

“…Our results open up a new avenue on exploring novel non-Hermitian phenomena arisen from the interplay between NHSE and anyonic statistics, and can potentially be demonstrated in ultracold atomic quantum simulators and quantum computers.…”
Get full text

Enhancing Scalability of Quantum Eigenvalue Transformation of Unitary Matrices for Ground State Preparation through Adaptive Finer Filtering by Erenay Karacan, Yanbin Chen, Christian B. Mendl

“…Hamiltonian simulation is a domain where quantum computers have the potential to outperform their classical counterparts. …”
Get full text

Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning by Sangwoo Park, Osvaldo Simeone

“…Quantum machine learning is a promising programming paradigm for the optimization of quantum algorithms in the current era of noisy intermediate-scale quantum computers. A fundamental challenge in quantum machine learning is generalization, as the designer targets performance under testing conditions while having access only to limited training data. …”
Get full text

Generalized Cycle Benchmarking Algorithm for Characterizing Midcircuit Measurements by Zhihan Zhang, Senrui Chen, Yunchao Liu, Liang Jiang

“…Midcircuit measurements (MCMs) are crucial ingredients in the development of fault-tolerant quantum computation. While there have been rapid experimental progresses in realizing MCMs, a systematic method for characterizing noisy MCMs is still under exploration. …”
Get full text

Quantum distance approximation for persistence diagrams by Bernardo Ameneyro, Rebekah Herrman, George Siopsis, Vasileios Maroulas

“…So, in this work we explore the potential of quantum computers to estimate the distance between persistence diagrams as the next step in the design of a fully quantum framework for TDA. …”
Get full text

Low-Rank Variational Quantum Algorithm for the Dynamics of Open Quantum Systems by Sara Santos, Xinyu Song, Vincenzo Savona

“…The simulation of many-body open quantum systems is key to solving numerous outstanding problems in physics, chemistry, material science, and in the development of quantum technologies. Near-term quantum computers may bring considerable advantage for the efficient simulation of their static and dynamical properties, thanks to hybrid quantum-classical variational algorithms to approximate the dynamics of the density matrix describing the quantum state in terms of an ensemble average. …”
Get full text

Probabilistic genotype-phenotype maps reveal mutational robustness of RNA folding, spin glasses, and quantum circuits by Anna Sappington, Vaibhav Mohanty

“…We study three model systems to show that PrGP maps offer a generalized framework which can handle uncertainty emerging from various physical sources: (1) thermal fluctuation in RNA folding, (2) external field disorder in the spin-glass ground state search problem, and (3) superposition and entanglement in quantum circuits, which are realized experimentally on IBM quantum computers. In all three cases, we observe a biphasic robustness scaling which is enhanced relative to random expectation for more frequent phenotypes and approaches random expectation for less frequent phenotypes. …”
Get full text

Convergence and Quantum Advantage of Trotterized MERA for Strongly-Correlated Systems by Qiang Miao, Thomas Barthel

“…Hence, the Trotterized MERA VQE is a promising route for the efficient investigation of strongly-correlated quantum many-body systems on quantum computers. Furthermore, we show how the convergence can be substantially improved by building up the MERA layer by layer in the initialization stage and by scanning through the phase diagram during optimization. …”
Get full text

Absence of gapless Majorana edge modes in few-leg bosonic flux ladders by F. A. Palm, C. Repellin, N. Goldman, F. Grusdt

“…The search for Majorana excitations has seen tremendous efforts in recent years, ultimately aiming for their individual controllability in future topological quantum computers. A promising framework to realize such exotic Majorana fermions are topologically ordered non-Abelian phases of matter, such as certain fractional quantum Hall states. …”
Get full text

Dynamical quantum maps for single-qubit gates under universal non-Markovian noise by J. M. Sánchez Velázquez, A. Steiner, R. Freund, M. Guevara-Bertsch, Ch. D. Marciniak, T. Monz, A. Bermudez

“…We gauge our predictions for experimentally relevant metrics against established characterization techniques run on a trapped-ion quantum computer. In particular, we find that experimental estimates of average gate errors measured through randomized benchmarking and reconstructed via quantum process tomography are tightly lower-bounded by our analytical estimates, while the depolarizing model overestimates the gate error. …”
Get full text

Symmetry-invariant quantum machine learning force fields by Isabel Nha Minh Le, Oriel Kiss, Julian Schuhmacher, Ivano Tavernelli, Francesco Tacchino

“…This approach has recently been extended to incorporate quantum computational methods, making use of variational quantum learning models to predict potential energy surfaces and atomic forces from ab initio training data. …”
Get full text

Towards large-scale quantum optimization solvers with few qubits by Marco Sciorilli, Lucas Borges, Taylor L. Patti, Diego García-Martín, Giancarlo Camilo, Anima Anandkumar, Leandro Aolita

“…Abstract Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. …”
Get full text

Convolutional Neural Decoder for Surface Codes by Hyunwoo Jung, Inayat Ali, Jeongseok Ha

“…To perform reliable information processing in quantum computers, quantum error correction (QEC) codes are essential for the detection and correction of errors in the qubits. …”
Get full text

Secure User Authentication With Information Theoretic Security Using Secret Sharing-Based Secure Computation by Keiichi Iwamura, Ahmad Akmal Aminuddin Mohd Kamal

“…Public key encryption-based digital signatures are widely used for user authentication; however, with the development of quantum computers they are highly likely to be deciphered. …”
Get full text

Approximate Solutions of Combinatorial Problems via Quantum Relaxations by Bryce Fuller, Charles Hadfield, Jennifer R. Glick, Takashi Imamichi, Toshinari Itoko, J. Richard Thompson, Yang Jiao, M. Marna Kagele, W. Blom-Schieber Adriana, Rudy Raymond, Antonio Mezzacapo

“…Understanding how to best use quantum computers for combinatorial optimization remains an ongoing area of study. …”
Get full text

A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity by Ryan L'Abbate, Anthony D'Onofrio, Samuel Stein, Samuel Yen-Chi Chen, Ang Li, Pin-Yu Chen, Juntao Chen, Ying Mao

“…This constraint greatly inhibits the range of applications that can leverage quantum computers. Moreover, as the available qubits increase, the computational complexity grows exponentially, posing additional challenges. …”
Get full text

Quantum complexity phase transitions in monitored random circuits by Ryotaro Suzuki, Jonas Haferkamp, Jens Eisert, Philippe Faist

“…In our proof, we make use of percolation theory to find paths along which an exponentially long quantum computation can be run below the critical rate, and to identify events where the state complexity is reset to zero above the critical rate. …”
Get full text