English
Related papers

Related papers: Quantum simulation of Pauli channels and dynamical…

200 papers

A quantum observable and a channel are considered compatible if they form parts of the same measurement device, otherwise they are incompatible. Constrains on compatibility between observables and channels can be quantified via relations…

Quantum Physics · Physics 2018-02-28 T. Heinosaari , D. Reitzner , T. Rybár , M. Ziman

Quantum simulation is a potentially powerful application of quantum computing, holding the promise to be able to emulate interesting quantum systems beyond the reach of classical computing methods. Despite such promising applications, and…

Quantum Physics · Physics 2022-10-07 Kaelyn J. Ferris , A. J. Rasmusson , Nicholas T. Bronn , Olivia Lanes

Stabilizer simulation of Clifford quantum circuits - error-correction circuits, Clifford subroutines, etc. - on classical computers has played a central role in our understanding of circuit performance. The stabilizer description, however,…

Quantum Physics · Physics 2026-03-24 Mark Myers , Mariesa H. Teo , Rajesh Mishra , Jing Hao Chai , Hui Khoon Ng

Here we revisit one of the prototypical tasks for characterizing the structure of noise in quantum devices: estimating every eigenvalue of an $n$-qubit Pauli noise channel to error $\epsilon$. Prior work [14] proved no-go theorems for this…

Quantum Physics · Physics 2025-09-16 Sitan Chen , Weiyuan Gong

This experimental study aims to investigate the convex combinations of Pauli semigroups with arbitrary mixing parameters to determine whether the resulting dynamical map exhibits Markovian or non-Markovian behavior. Specifically, we…

Quantum Physics · Physics 2024-11-05 Vaishali Gulati , Vinayak Jagadish , R. Srikanth , Kavita Dorai

Modelling non-linear activation functions on quantum computers is vital for quantum neurons employed in fully quantum neural networks, however, remains a challenging task. We introduce an amplitude-based implementation for approximating…

Quantum Physics · Physics 2023-02-09 Jonas Koppe , Mark-Oliver Wolf

The process of translating a quantum algorithm into a form suitable for implementation on a quantum computing platform is crucial but yet challenging. This entails specifying quantum operations with precision, a typically intricate task. In…

Quantum Physics · Physics 2024-08-26 M. Zomorodi , H. Amini , M. Abbaszadeh , J. Sohrabi , V. Salari , P. Plawiak

Characterizing quantum dynamics is essential for quantifying arbitrary properties of a quantum process -- such as its ability to exhibit quantum-mechanical dynamics or generate entanglement. However, current methods require a number of…

It is generally considered that the signal output by a quantum circuit is attenuated exponentially fast in the number of gates. This letter explores how algorithms using mid-circuit measurements and classical conditioning as computational…

Quantum Physics · Physics 2024-01-05 Etienne Granet , Henrik Dreyer

Despite extensive research efforts, few quantum algorithms for classical optimization demonstrate realizable quantum advantage. The utility of many quantum algorithms is limited by high requisite circuit depth and nonconvex optimization…

Quantum Physics · Physics 2022-01-27 Taylor L. Patti , Jean Kossaifi , Anima Anandkumar , Susanne F. Yelin

In this work we propose a simple optical architecture, based on phase-only programmable spatial light modulators, in order to characterize general processes on photonic spatial quantum systems in a $d>2$ Hilbert space. We demonstrate the…

Quantum Physics · Physics 2023-01-27 Juan José Miguel Varga , Lorena Rebón , Quimey Pears Stefano , Claudio Iemmi

The coexistence of quantum and classical signals over the same optical fiber with minimal degradation of the transmitted quantum information is critical for operating large-scale quantum networks over the existing communications…

While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…

Quantum Physics · Physics 2018-01-01 Jacob Miller , Stephen Sanders , Akimasa Miyake

In this paper, we design quantum circuits for the exponential of scaled $n$-qubit Pauli strings using single-qubit rotation gates, Hadamard gate, and CNOT gates. A key result we derive is that any two Pauli-string operators composed of…

Quantum Physics · Physics 2024-11-05 Rohit Sarma Sarkar , Sabyasachi Chakraborty , Bibhas Adhikari

Quantum simulations are designed to model quantum systems, and many compilation frameworks have been developed for executing such simulations on quantum computers. Most compilers leverage the capabilities of digital and analog quantum…

Quantum Physics · Physics 2025-09-26 Liyi Li , Federico Zahariev , Chandeepa Dissanayake , Jae Swanepoel , Amr Sabry , Mark S. Gordon

We propose a method to detect lower bounds to quantum capacities of a noisy quantum communication channel by means of few measurements. The method is easily implementable and does not require any knowledge about the channel. We test its…

Quantum Physics · Physics 2016-04-12 Chiara Macchiavello , Massimiliano F. Sacchi

Quantum systems are inherently open and susceptible to environmental noise, which can have both detrimental and beneficial effects on their dynamics. This phenomenon has been observed in bio-molecular systems, where noise enables novel…

We show that entangled measurements provide an exponential advantage in sample complexity for Pauli channel estimation, which is both a fundamental problem and a practically important subroutine for benchmarking near-term quantum devices.…

Quantum Physics · Physics 2022-03-23 Senrui Chen , Sisi Zhou , Alireza Seif , Liang Jiang

Understanding the noise affecting a quantum device is of fundamental importance for scaling quantum technologies. A particularly important class of noise models is that of Pauli channels, as randomized compiling techniques can effectively…

Quantum Physics · Physics 2025-05-19 Omar Fawzi , Aadil Oufkir , Daniel Stilck França

In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…

Quantum Physics · Physics 2026-01-19 Mostafa Atallah , Alvin Gonzales , Daniel Dilley , Igor Gaidai , Zain H. Saleem , Rebekah Herrman
‹ Prev 1 8 9 10 Next ›