Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Fitzpatrick, Nathan"'
Autor:
Rosenkranz, Matthias, Brunner, Eric, Marin-Sanchez, Gabriel, Fitzpatrick, Nathan, Dilkes, Silas, Tang, Yao, Kikuchi, Yuta, Benedetti, Marcello
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variables and the initial state is defined by a multivariate function. We de
Externí odkaz:
http://arxiv.org/abs/2405.21058
Autor:
Ruiz, Francisco J. R., Laakkonen, Tuomas, Bausch, Johannes, Balog, Matej, Barekatain, Mohammadamin, Heras, Francisco J. H., Novikov, Alexander, Fitzpatrick, Nathan, Romera-Paredes, Bernardino, van de Wetering, John, Fawzi, Alhussein, Meichanetzidis, Konstantinos, Kohli, Pushmeet
A key challenge in realizing fault-tolerant quantum computers is circuit optimization. Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T gates), we address the problem of T-count optimization, i.e., minimizing
Externí odkaz:
http://arxiv.org/abs/2402.14396
Autor:
Greene-Diniz, Gabriel, Manrique, David Zsolt, Yamamoto, Kentaro, Plekhanov, Evgeny, Fitzpatrick, Nathan, Krompiec, Michal, Sakuma, Rei, Ramo, David Muñoz
Publikováno v:
Quantum 8, 1383 (2024)
In this paper, we present a quantum computational method to calculate the many-body Green's function matrix in a spin orbital basis. We apply our approach to finite-sized fermionic Hubbard models and related impurity models within Dynamical Mean Fiel
Externí odkaz:
http://arxiv.org/abs/2309.09685
The Quantum Singular Value Transformation (QSVT) is a technique that provides a unified framework for describing many of the quantum algorithms discovered to date. We implement a noise-free simulation of the technique to investigate how it can be use
Externí odkaz:
http://arxiv.org/abs/2307.13583
We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution, using mid-circuit measurements on a single ancilla qubit. Imaginary time evolution (ITE) is widely used for obtaining t
Externí odkaz:
http://arxiv.org/abs/2304.07917
We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using exactly emulated
Externí odkaz:
http://arxiv.org/abs/2303.06161
Publikováno v:
Quantum 8, 1278 (2024)
Subspace diagonalisation methods have appeared recently as promising means to access the ground state and some excited states of molecular Hamiltonians by classically diagonalising small matrices, whose elements can be efficiently obtained by a quant
Externí odkaz:
http://arxiv.org/abs/2211.16097
Publikováno v:
EPJ Quantum Technol. 9, 5 (2022)
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable. Therefore, practitioners rely on heuristic solution approach
Externí odkaz:
http://arxiv.org/abs/2109.03745
Unitary Coupled Cluster (UCC) approaches are an appealing route to utilising quantum hardware to perform quantum chemistry calculations, as quantum computers can in principle perform UCC calculations in a polynomially scaling fashion, as compared to
Externí odkaz:
http://arxiv.org/abs/2108.10912
Simulating time evolution of quantum systems is one of the most promising applications of quantum computing and also appears as a subroutine in many applications such as Green's function methods. In the current era of NISQ machines we assess the stat
Externí odkaz:
http://arxiv.org/abs/2106.03985