Related papers: A Simple and Efficient Joint Measurement Strategy …
An important class of fermionic observables, relevant in tasks such as fermionic partial tomography and estimating energy levels of chemical Hamiltonians, are the binary measurements obtained from the product of anti-commuting Majorana…
Estimation of expectation values of incompatible observables is an essential practical task in quantum computing, especially for approximating energies of chemical and other many-body quantum systems. In this work we introduce a method for…
A potential approach for demonstrating quantum advantage is using quantum computers to simulate fermionic systems. Quantum algorithms for fermionic system simulation usually involve the Hamiltonian evolution and measurements. However, in…
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…
Simulating computationally hard fermionic systems is a promising application of quantum computing. However, mapping nonlocal fermionic operators to qubits often produces deep circuits, rendering such simulations impractical on near-term…
Because Majorana zero modes store quantum information non-locally, they are protected from noise, and have been proposed as a building block for a quantum computer. We show how to use the same protection from noise to implement universal…
Measuring the expectation value of the molecular electronic Hamiltonian is one of the challenging parts of the variational quantum eigensolver. A widely used strategy is to express the Hamiltonian as a sum of measurable fragments using…
Simulating fermionic systems on a quantum computer requires a high-performing mapping of fermionic states to qubits. A characteristic of an efficient mapping is its ability to translate local fermionic interactions into local qubit…
Shadow tomography via classical shadows is a state-of-the-art approach for estimating properties of a quantum state. We present a simplified, combinatorial analysis of a recently proposed instantiation of this approach based on the ensemble…
Motivated by a recent experiment [Nadj-Perge et al., Science 346, 602 (2014)] providing evidence for Majorana zero modes in iron chains on the superconducting Pb surface, in the present work, we theoretically propose an all-optical scheme…
We propose an efficient and almost optimal scheme for measuring molecular Hamiltonians in quantum chemistry on quantum computers, which requires $2N^2$ distinct measurements in the leading order with $N$ being the number of molecular…
We introduce Majorana Propagation, an algorithmic framework for the classical simulation of Fermionic circuits. Inspired by Pauli Propagation, Majorana Propagation operates by applying successive truncations throughout the Heisenberg…
Variational quantum algorithms (VQAs) have been proposed as one of the most promising approaches to demonstrate quantum advantage on noisy intermediate-scale quantum (NISQ) devices. However, it has been unclear whether VQAs can maintain…
We provide a detailed analysis of our previously proposed scheme [Phys. Rev. Lett. 88, 180401, (2002)] to engineer the profile of the hopping amplitudes for atomic gases in a 1D optical lattice so that the particle number becomes…
We introduce an exactly solvable model of interacting Majorana fermions realizing $Z_{2}$ topological order with a $Z_{2}$ fermion parity grading and lattice symmetries permuting the three fundamental anyon types. We propose a concrete…
We derive the Hamiltonian for cold fermionic atoms in an optical lattice across a broad Feshbach resonance, taking into account of both multiband occupations and neighboring-site collisions. Under typical configurations, the resulting…
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 crucial subroutine for various quantum computing and communication algorithms is to efficiently extract different classical properties of quantum states. In a notable recent theoretical work by Huang, Kueng, and Preskill [Nat. Phys. 16,…
Achieving quantum advantage in efficiently estimating collective properties of quantum many-body systems remains a fundamental goal in quantum computing. While the quantum gradient estimation (QGE) algorithm has been shown to achieve doubly…
Performing large-scale, accurate quantum simulations of many-fermion systems is a central challenge in quantum science, with applications in chemistry, materials, and high-energy physics. Despite significant progress, realizing generic…