English
Related papers

Related papers: Quantum Merlin-Arthur with noisy channel

200 papers

We propose using variational quantum algorithms (VQAs) to simulate established quantum algorithms under realistic noise conditions, aiming to surpass the fidelity of theoretical circuits in noisy environments. Focusing on the Quantum…

The goal of this paper is to review the theoretical basis for achieving a faithful quantum information transmission and processing in the presence of noise. Initially encoding and decoding, implementing gates and quantum error correction…

Quantum Physics · Physics 2007-05-23 P. J. Salas

Learning unknown processes affecting a quantum system reveals underlying physical mechanisms and enables suppression, mitigation, and correction of unwanted effects. Describing a general quantum process requires an exponentially large…

We re-examine a non-Gaussian quantum error correction code designed to protect optical coherent-state qubits against errors due to an amplitude damping channel. We improve on a previous result [Phys. Rev. A 81, 062344 (2010)] by providing a…

Quantum Physics · Physics 2014-05-14 Ricardo Wickert , Peter van Loock

Cluster states and graph states in general offer a useful model of the stabilizer formalism and a path toward the development of measurement-based quantum computation. Their defining structure - the stabilizer group - encodes all possible…

Quantum Physics · Physics 2026-01-23 Konrad Szymański , Lina Vandré , Otfried Gühne

Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output…

Quantum Physics · Physics 2025-12-03 Matthias Christandl , Omar Fawzi , Ashutosh Goswami

We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by…

Quantum Physics · Physics 2007-05-23 Panos Aliferis , Debbie W. Leung

We consider fault-tolerant quantum computation in the context where there are no fresh ancilla qubits available during the computation, and where the noise is due to a general quantum channel. We show that there are three classes of noisy…

Quantum Physics · Physics 2013-01-11 Michael Ben-Or , Daniel Gottesman , Avinatan Hassidim

QMA (Quantum Merlin-Arthur) is the quantum analogue of the class NP. There are a few QMA-complete problems, most notably the ``Local Hamiltonian'' problem introduced by Kitaev. In this dissertation we show some new QMA-complete problems.…

Quantum Physics · Physics 2007-12-19 Yi-Kai Liu

This paper proves the threshold result, which asserts that quantum computation can be made robust against errors and inaccuracies, when the error rate, $\eta$, is smaller than a constant threshold, $\eta_c$. The result holds for a very…

Quantum Physics · Physics 2007-05-23 Dorit Aharonov , Michael Ben-Or

Graph states are entangled states useful for several quantum information processing tasks such as measurement-based quantum computation and quantum metrology. As the size of graph states realized in experiments increases, it becomes more…

Quantum Physics · Physics 2023-09-18 Tomonori Tanizawa , Yuki Takeuchi , Shion Yamashika , Ryosuke Yoshii , Shunji Tsuchiya

Quantum error correcting codes enable the information contained in a quantum state to be protected from decoherence due to external perturbations. Applied to NMR, quantum coding does not alter normal relaxation, but rather converts the…

Quantum computation, a completely different paradigm of computing, benefits from theoretically proven speed-ups for certain problems and opens up the possibility of exactly studying the properties of quantum systems. Yet, because of the…

We define and study a variant of QMA (Quantum Merlin Arthur) in which Arthur can make multiple non-collapsing measurements to Merlin's witness state, in addition to ordinary collapsing measurements. By analogy to the class PDQP defined by…

Quantum Physics · Physics 2024-11-06 Scott Aaronson , Sabee Grewal , Vishnu Iyer , Simon C. Marshall , Ronak Ramachandran

The generation and verification of quantum states are fundamental tasks for quantum information processing that have recently been investigated by Irani, Natarajan, Nirkhe, Rao and Yuen [CCC 2022], Rosenthal and Yuen [ITCS 2022], Metger and…

Quantum Physics · Physics 2023-12-29 François Le Gall , Masayuki Miyamoto , Harumichi Nishimura

To implement quantum algorithms on a quantum computer, we must overcome the twin problems of fault-tolerance -- how can we realize a relatively noiseless computation by cleverly combining noisy components? -- and compilation -- how can we…

Quantum Physics · Physics 2026-04-29 Jack Weinberg , Narayanan Rengaswamy

Quantum technologies work by utilizing properties inherent in quantum systems such as quantum coherence and quantum entanglement and are expected to be superior to classical counterparts for solving certain problems in science and…

Quantum Physics · Physics 2023-04-10 Yusuke Hama , Hirofumi Nishi

We introduce the notion of fault-tolerant quantum metrology to overcome noise beyond our control -- associated with sensing the parameter, by reducing the noise in operations under our control -- associated with preparing and measuring…

Quantum Physics · Physics 2019-08-29 Theodoros Kapourniotis , Animesh Datta

To establish an entangled state of optimal fidelity between two distant observers when the available quantum channel is noisy, is a central problem in quantum information theory. We consider an instance of this problem for two-qubit systems…

Quantum Physics · Physics 2012-09-18 Somshubhro Bandyopadhyay , Anindita Ghosh

Quantum effect enables enhanced estimation precision in metrology, with the Heisenberg limit (HL) representing the ultimate limit allowed by quantum mechanics. Although the HL is generally unattainable in the presence of noise, quantum…

Quantum Physics · Physics 2026-01-15 Himanshu Sahu , Qian Xu , Sisi Zhou
‹ Prev 1 3 4 5 6 7 10 Next ›