English
Related papers

Related papers: Efficient classical simulation of matchgate circui…

200 papers

If classical algorithms have been successful in reproducing the estimation of expectation values of observables of some quantum circuits using off-the-shelf computing resources, matching the performance of the most advanced quantum devices…

Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…

Quantum Physics · Physics 2017-03-21 E. Farhi , J. Goldstone , S. Gutmann , H. Neven

We provide general sufficient conditions for the efficient classical simulation of quantum-optics experiments that involve inputting states to a quantum process and making measurements at the output. The first condition is based on the…

Quantum Physics · Physics 2016-06-23 Saleh Rahimi-Keshari , Timothy C. Ralph , Carlton M. Caves

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally…

The classical simulation of quantum circuits is of central importance for benchmarking near-term quantum devices. The fact that gates belonging to the Clifford group can be simulated efficiently on classical computers has motivated a range…

Quantum Physics · Physics 2023-07-12 Tomislav Begušić , Kasra Hejazi , Garnet Kin-Lic Chan

A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating…

Quantum Physics · Physics 2021-06-23 Matija Medvidovic , Giuseppe Carleo

Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…

Quantum Physics · Physics 2025-05-21 S. Alipour , A. T. Rezakhani , Alireza Tavanfar , K. Mölmer , T. Ala-Nissila

Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach…

Quantum Physics · Physics 2023-05-31 Chufan Lyu , Xiaoyu Tang , Junning Li , Xusheng Xu , Man-Hong Yung , Abolfazl Bayat

Quantum processors rely on classical electronic controllers to manipulate and read out the quantum state. As the performance of the quantum processor improves, non-idealities in the classical controller can become the performance bottleneck…

This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…

Quantum Physics · Physics 2024-10-01 Zhong-Yi Ni , Yu-Sheng Zhao , Jin-Guo Liu

Quantum computing has the potential to revolutionize multiple fields by solving complex problems that can not be solved in reasonable time with current classical computers. Nevertheless, the development of quantum computers is still in its…

A new method for simulation of a binary homogeneous Markov process using a quantum computer was proposed. This new method allows using the distinguished properties of the quantum mechanical systems -- superposition, entanglement and…

Quantum Physics · Physics 2021-03-12 Petar Nikolov

Simulating many-body fermionic systems in conventional qubit-based quantum computers poses significant challenges due to the overheads associated with the encoding of fermionic statistics in qubits, leading to the proposal of native…

Quantum Physics · Physics 2025-12-15 Ahana Ghoshal , Carlos de Gois , Kiara Hansenne , Otfried Gühne , Hai-Chau Nguyen

We investigate Clifford+$T$ quantum circuits with a small number of $T$-gates. Using the sparsification lemma, we identify time complexity lower bounds in terms of $T$-gate count below which a strong simulator would improve on the…

Quantum Physics · Physics 2019-02-26 Cupjin Huang , Michael Newman , Mario Szegedy

As quantum technology advances, quantum simulation becomes increasingly promising, with significant implications for quantum many-body physics and quantum chemistry. Despite being one of the most accessible simulation methods, the product…

Quantum Physics · Physics 2024-07-22 Wenjun Yu , Jue Xu , Qi Zhao

Accurate characterisation of two-qubit gates will be critical for any realisation of quantum computation. We discuss a range of measurements aimed at characterising a two-qubit gate, specifically the CNOT gate. These measurements are…

In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…

Some of the most enduring questions in physics--including the quantum measurement problem and the quantization of gravity--involve the interaction of a quantum system with a classical environment. Two linearly coupled harmonic oscillators…

Quantum Physics · Physics 2007-05-23 Rachael M. McDermott , Ian H. Redmount

We experimentally demonstrate a virtual two-qubit gate and characterize it using quantum process tomography~(QPT). The virtual two-qubit gate decomposes an actual two-qubit gate into single-qubit unitary gates and projection gates in…

A sequence of controlled collisions between a quantum system and its environment (composed of a set of quantum objects) naturally simulates (with arbitrary precision) any Markovian quantum dynamics of the system under consideration. In this…

Quantum Physics · Physics 2012-08-01 Tomas Rybar , Sergey N. Filippov , Mario Ziman , Vladimir Buzek
‹ Prev 1 8 9 10 Next ›