Related papers: Easy Control over Fermionic Computations
Efficient simulation of interacting fermionic systems is a key application of near-term quantum computers, but is hindered by the overhead required to encode fermionic operators on qubit hardware. Here, we consider models with $N$ fermionic…
The objective of this series of papers is to recover information regarding the behaviour of FQ operations in the case $n=2$, and FQ conform-operations in the case $n=3$. In this second part we show some arithmetically constructible examples…
We review existing classical simulation methods for performing fermionic Gaussian operations and develop new methods to address the gap by adhering to the fundamental theoretical framework established by Bravyi [Quantum Info. Comput. 5, 216…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, or marginals, of the full state. The most…
A unifying framework for the control of quantum systems with non-Abelian holonomy is presented. It is shown that, from a control theoretic point of view, holonomic quantum computation can be treated as a control system evolving on a…
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…
This review summarizes recent developments in the study of fermionic quantum criticality, focusing on new progress in numerical methodologies, especially quantum Monte Carlo methods, and insights that emerged from recently large-scale…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
Simulating complex systems remains an ongoing challenge for classical computers, while being recognised as a task where a quantum computer has a natural advantage. In both digital and analogue quantum simulations the system description is…
Recently, we have used a projection operator to fix the number of particles in a second quantization approach in order to deal with the canonical ensemble. Having been applied earlier to handle various problems in nuclear physics that…
Quantum computing, leveraging quantum phenomena like superposition and entanglement, is emerging as a transformative force in computing technology, promising unparalleled computational speed and efficiency crucial for engineering…
Quantum computing is emerging as a promising tool in nuclear physics. However, the cost of encoding fermionic operators hampers the application of algorithms in current noisy quantum devices. In this work, we analyze an encoding scheme…
We study the stability of holonomic quantum computations with respect to errors in assignment of control parameters. The general expression for fidelity is obtaned. In the small errors limit the simple formulae for the fidelity decrease…
The engineering and control of devices at the quantum-mechanical level--such as those consisting of small numbers of atoms and photons--is a delicate business. The fundamental uncertainty that is inherently present at this scale manifests…
The mapping of fermionic states onto qubit states, as well as the mapping of fermionic Hamiltonian into quantum gates enables us to simulate electronic systems with a quantum computer. Benefiting the understanding of many-body systems in…
A new model of quantum computing has recently been proposed which, in analogy with a classical lambda-calculus, exploits quantum processes which operate on other quantum processes. One such quantum meta-operator takes N unitary…
Despite using a novel model of computation, quantum computers break down programs into elementary gates. Among such gates, entangling gates are the most expensive. In the context of fermionic simulations, we develop a suite of compilation…
We introduce the fermionic ZW calculus, a string-diagrammatic language for fermionic quantum computing (FQC). After defining a fermionic circuit model, we present the basic components of the calculus, together with their interpretation, and…
Schemes of classical shadows have been developed to facilitate the read-out of digital quantum devices, but similar tools for analog quantum simulators are scarce and experimentally impractical. In this work, we provide a measurement scheme…