Papers

Zichang He, Raymond H. Putra, R. Shaydulin +1 more·Feb 6, 2025

Solving hard optimization problems is one of the most promising application domains for quantum computers due to the ubiquity of such problems in industry and the availability of broadly applicable theoretical quantum speedups. However, the ability o...

Vicente Pina-Canelles, Adrian Auer, In'es de Vega·Feb 6, 2025

Quantum computers with a limited qubit connectivity require inserting SWAP gates for qubit routing, which increases gate execution errors and the impact of environmental noise due to an overhead in circuit depth. In this work, we benchmark various ro...

Vincenzo Lipardi, D. Dibenedetto, Georgios Stamoulis +1 more·Feb 6, 2025

The performance of Variational Quantum Algorithms (VQAs) strongly depends on the choice of the parameterized quantum circuit to optimize. One of the biggest challenges in VQAs is designing quantum circuits tailored to the particular problem. This art...

Aravind Plathanam Babu, Oskari Kerppo, A. Muñoz-Moller +2 more·Feb 6, 2025

The limited qubit connectivity of quantum processors poses a significant challenge in deploying practical algorithms and logical gates, necessitating efficient qubit mapping and routing strategies. When implementing a gate that requires additional co...

Cheng Li, Girish Kulkarni, Isaac Soward +6 more·Feb 5, 2025

Two-photon states generated from spontaneous parametric down-conversion (SPDC) can display entanglement in all degrees of freedom (DoFs) of light, including spatial, temporal, and polarization. The coupling between different DoFs of a two-photon stat...

Taishi Kawamoto, Ryota Maeda, Nanami Nakamura +1 more·Feb 5, 2025

We study (i) Janus deformations and (ii) non-local double trace deformations of a pair of CFTs, as two different ways to construct CFT duals of traversable AdS wormholes. First, we construct a simple model of traversable wormholes by gluing two Poinc...

Urmimala Dewan, Parvendra Kumar, Amarendra K. Sarma·Feb 5, 2025

Polarization-entangled photons are key resources for a wide range of protocols in quantum computation and quantum key distribution. Achieving a near-unity degree of polarization entanglement is essential for minimizing qubit error rates in secure key...

Gwenael Le Gal, G. Butseraen, A. Ranadive +6 more·Feb 5, 2025

Superconducting traveling-wave parametric amplifiers (TWPAs) are increasingly used in various applications, including quantum computing, quantum sensing, and dark matter detection. However, one important characteristic of these amplifiers, gain compr...

Matthew Hagan, Nathan Wiebe·Feb 5, 2025

In this work we investigate a model of thermalization wherein a single ancillary qubit randomly interacts with the system to be thermalized. This not only sheds light on the emergence of Gibbs states in nature, but also provides a routine for prepari...

Moein Malekakhlagh, A. Seif, D. Puzzuoli +2 more·Feb 5, 2025

Effective noise models are essential for analyzing and understanding the dynamics of quantum systems, particularly in applications like quantum error mitigation and correction. However, even when noise processes are well-characterized in isolation, t...

Vladyslav Bohun, M. Grandadam, M. Koch-Janusz·Feb 5, 2025

Simulations of quantum dynamics are a key application of near term quantum computing, but are hindered by the twin challenges of noise and small device scale, which limit the executable circuit depths and the number of qubits the algorithm can be run...

N. F. Castro, J. G. Milhano, Maria Gabriela Jordão Oliveira·Feb 5, 2025

The intrinsic quantum nature of jets and the Quark-Gluon Plasma makes the study of jet quenching a promising candidate to benefit from quantum computing power. Standing as a precursor of the full study of this phenomenon, we study the propagation of ...

Zhi-cheng He, Zheng-Yuan Xue·Feb 5, 2025

Quantum error correction represents a significant advancement in large-scale quantum computing. However, achieving fault-tolerant implementations of non-Clifford logical gates with reduced overhead remains a challenge in the popular surface code stra...

Wei Tang, M. Martonosi·Feb 5, 2025

A quantum processing unit (QPU) must contain a large number of high quality qubits to produce accurate results for problems at useful scales. In contrast, most scientific and industry classical computation workloads happen in parallel on distributed ...

Rafał Bistroń, Marcin Rudziński, Ryszard Kukulski +1 more·Feb 4, 2025

Rapid development of quantum computing technology has led to a wide variety of sophisticated quantum devices. Benchmarking these systems becomes crucial for understanding their capabilities and paving the way for future advancements. The Quantum Volu...

Derek Khu, Andrew Tanggara, Chao Jin +1 more·Feb 4, 2025

Universal fault-tolerant quantum computation requires overcoming the Eastin--Knill theorem on quantum error correction (QEC) codes that protect information from noise. This is often accomplished through strategies like magic state distillation, which...

Benjamin Van Osch, Andrija Paurevic, Ali Sakr +5 more·Feb 4, 2025

We present an automated protocol for tuning single-electron transistors (SETs) and single-hole transistors (SHTs) to operate as high-sensitivity DC charge sensors. The protocol initializes a previously unmeasured device after cooldown, identifies a w...

Rutwig Campoamor-Stursberg, Francisco J. Herranz, Danilo Latini +2 more·Feb 4, 2025

We consider the quantum analog of the generalized Zernike systems given by the Hamiltonian: $$\hat{\mathcal{H}}_N =\hat{p}_1^2+\hat{p}_2^2+\sum_{k=1}^N γ_k (\hat{q}_1 \hat{p}_1+\hat{q}_2 \hat{p}_2)^k ,$$ with canonical operators $\hat{q}_i,\, \hat{p}...

Samuele Pedrielli, Christopher J. Anders, Lena Funcke +3 more·Feb 4, 2025

Parameter shift rules (PSRs) are key techniques for efficient gradient estimation in variational quantum eigensolvers (VQEs). In this paper, we propose its Bayesian variant, where Gaussian processes with appropriate kernels are used to estimate the g...

Rebecca R. B. Chung, Nelly H. Y. Ng, Yu Cai·Feb 4, 2025

Quantum key distribution requires tight and reliable bounds on the secret key rate to ensure robust security. This is particularly so for the regime of finite block sizes, where the optimization of generalized Rényi entropic quantities is known to pr...