1 code implementation • 8 Sep 2021 • Louis Schatzki, Andrew Arrasmith, Patrick J. Coles, M. Cerezo
For this purpose, we introduce the NTangled dataset composed of quantum states with different amounts and types of multipartite entanglement.
no code implementations • 2 Sep 2021 • Samson Wang, Piotr Czarnik, Andrew Arrasmith, M. Cerezo, Lukasz Cincio, Patrick J. Coles
On the other hand, our positive results for CDR highlight the possibility of engineering error mitigation methods to improve trainability.
no code implementations • 23 Aug 2021 • Andi Gu, Angus Lowe, Pavel A. Dub, Patrick J. Coles, Andrew Arrasmith
Variational Quantum Algorithms (VQAs) are a promising approach for practical applications like chemistry and materials science on near-term quantum computers as they typically reduce quantum resource requirements.
no code implementations • 12 Apr 2021 • Andrew Arrasmith, Zoë Holmes, M. Cerezo, Patrick J. Coles
Optimizing parameterized quantum circuits (PQCs) is the leading approach to make use of near-term quantum computers.
no code implementations • 11 Feb 2021 • Piotr Czarnik, Andrew Arrasmith, Lukasz Cincio, Patrick J. Coles
Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms.
Quantum Physics
no code implementations • 8 Feb 2021 • Joe Gibbs, Kaitlin Gili, Zoë Holmes, Benjamin Commeau, Andrew Arrasmith, Lukasz Cincio, Patrick J. Coles, Andrew Sornborger
Specifically, we simulate an XY-model spin chain on the Rigetti and IBM quantum computers, maintaining a fidelity of at least 0. 9 for over 600 time steps.
1 code implementation • 16 Dec 2020 • M. Cerezo, Andrew Arrasmith, Ryan Babbush, Simon C. Benjamin, Suguru Endo, Keisuke Fujii, Jarrod R. McClean, Kosuke Mitarai, Xiao Yuan, Lukasz Cincio, Patrick J. Coles
Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high computational cost.
no code implementations • 24 Nov 2020 • Andrew Arrasmith, M. Cerezo, Piotr Czarnik, Lukasz Cincio, Patrick J. Coles
We numerically confirm this by training in a barren plateau with several gradient-free optimizers (Nelder-Mead, Powell, and COBYLA algorithms), and show that the numbers of shots required in the optimization grows exponentially with the number of qubits.
no code implementations • 17 Nov 2020 • Enrico Fontana, M. Cerezo, Andrew Arrasmith, Ivan Rungger, Patrick J. Coles
(2) We study the resilience of the symmetries under noise, and show that while it is conserved under unital noise, non-unital channels can break these symmetries and lift the degeneracy of minima, leading to multiple new local minima.