Mappings between fermions and qubits are valuable constructions in physics. To date only a handful exist. In addition to revealing dualities between fermionic and spin systems, such mappings are indispensable in any quantum simulation of fermionic physics on quantum computers. The number of qubits required per fermionic mode, and the locality of mapped fermionic operators strongly impact the cost of such simulations. We present a novel fermion to qubit mapping which outperforms all previous local mappings in both the qubit to mode ratio, and the locality of mapped operators.
Entanglement, quantum steering and nonlocality are distinct quantum correlations which are the resources behind various of quantum information and quantum computation applications. However, a central question of determining the precise quantitative relation among them is still unresolved. Here, we present a mapping criterion between Bell nonlocality and quantum steering in bipartite qudit-qubit system, as well as a mapping criterion between quantum steering and quantum entanglement in bipartite qubit-qudit system, starting from the fundamental concepts of quantum correlations. Precise quantita…
We present a method for encoding second-quantized fermionic systems in qubits when the number of fermions is conserved, as in the electronic structure problem. When the number $F$ of fermions is much smaller than the number $M$ of modes, this symmetry reduces the number of information-theoretically required qubits from $Θ(M)$ to $O(F\log M)$. In this limit, our encoding requires $O(F^2\log^4 M)$ qubits, while encoded fermionic creation and annihilation operators have cost $O(F^2\log^5 M)$ in two-qubit gates. When incorporated into randomized simulation methods, this permits simulating time-evo…
Simulating fermionic lattice models with qubits requires mapping fermionic degrees of freedom to qubits. The simplest method for this task, the Jordan-Wigner transformation, yields strings of Pauli operators acting on an extensive number of qubits. This overhead can be a hindrance to implementation of qubit-based quantum simulators, especially in the analog context. Here we thus review and analyze alternative fermion-to-qubit mappings, including the two approaches by Bravyi and Kitaev and the Auxiliary Fermion transformation. The Bravyi-Kitaev transform is reformulated in terms of a classical …
We introduce a fermion-to-qubit mapping defined on ternary trees, where any single Majorana operator on an $n$-mode fermionic system is mapped to a multi-qubit Pauli operator acting nontrivially on $\lceil \log_3(2n+1)\rceil$ qubits. The mapping has a simple structure and is optimal in the sense that it is impossible to construct Pauli operators in any fermion-to-qubit mapping acting nontrivially on less than $\log_3(2n)$ qubits on average. We apply it to the problem of learning $k$-fermion reduced density matrix (RDM), a problem relevant in various quantum simulation applications. We show tha…
The future challenge of quantum communication are scalable quantum networks, which require coherent and reversible mapping of photonic qubits onto stationary atomic systems (quantum memories). A crucial requirement for realistic networks is the ability to efficiently store multiple qubits in one quantum memory. Here we demonstrate coherent and reversible mapping of 64 optical modes at the single photon level in the time domain onto one solid-state ensemble of rare-earth ions. Our light-matter interface is based on a high-bandwidth (100 MHz) atomic frequency comb, with a pre-determined storage …
The present paper is both a review on the Feynman problem, and an original research presentation on the relations between Fermionic theories and qubits theories, both regarded in the novel framework of operational probabilistic theories. The most relevant results about the Feynman problem of simulating Fermions with qubits are reviewed, and in the light of the new original results the problem is solved. The answer is twofold. On the computational side the two theories are equivalent, as shown by Bravyi and Kitaev (Ann. Phys. 298.1 (2002): 210-226). On the operational side the quantum theory of…
In this paper we investigate the entanglement of multi-qubit fermionic coherent states described by anticommutative Grassmann numbers. Choosing an appropriate weight function, we show that it is possible to construct some entangled pure states, consisting of {\bf{GHZ}}, {\bf{W}}, Bell and biseparable states, by tensor product of fermion coherent states. Moreover a comparison with maximal entangled bosonic coherent states is presented and it is shown that in some cases they have fermionic counterpart which are maximal entangled after integration with suitable weight functions.
Identifying the Bolch sphere with the Riemann sphere(the extended complex plane), we obtain relations between single qubit unitary operations and Möbius transformations on the extended complex plane.
Stabilizer-based quantum simulation of fermion dynamics with local qubit encodings
IBM Quantum, IBM Research Europe - Zurich（IBM量子，IBM欧洲苏黎世研究中心）；Institute for Theoretical Physics, ETH Zürich（苏黎世联邦理工学院理论物理研究所）；Institute of Physics, École Polytechnique Fédérale de Lausanne (EPFL)（洛桑联邦理工学院物理研究所）
In recent work [arXiv:2003.06939v2] a novel fermion to qubit mapping -- called the compact encoding -- was introduced which outperforms all previous local mappings in both the qubit to mode ratio, and the locality of mapped operators. There the encoding was demonstrated for square and hexagonal lattices. Here we present an extension of that work by illustrating how to apply the compact encoding to other regular lattices. We give constructions for variants of the compact encoding on all regular tilings with maximum degree 4. These constructions yield edge operators with Pauli weight at most 3 a…
Quantum simulation of fermionic systems is a promising application of quantum computers, but in order to program them, we need to map fermionic states and operators to qubit states and quantum gates. While quantum processors may be built as two-dimensional qubit networks with couplings between nearest neighbors, standard Fermion-to-qubit mappings do not account for that kind of connectivity. In this work we concatenate the (one-dimensional) Jordan-Wigner transform with specific quantum codes defined under the addition of a certain number of auxiliary qubits. This yields a novel class of mappin…
We consider Majorana fermion stabilizer codes with small number of modes and distance. We give an upper bound on the number of logical qubits for distance $4$ codes, and we construct Majorana fermion codes similar to the classical Hamming code that saturate this bound. We perform numerical studies and find other distance $4$ and $6$ codes that we conjecture have the largest possible number of logical qubits for the given number of physical Majorana modes. Some of these codes have more logical qubits than any Majorana fermion code derived from a qubit stabilizer code.
We introduce a new gate that transfers an arbitrary state of a qubit into a superposition of two quasi-orthogonal coherent states of a cavity mode, with opposite phases. This qcMAP gate is based on conditional qubit and cavity operations exploiting the energy level dispersive shifts, in the regime where they are much stronger than the cavity and qubit linewidths. The generation of multi-component superpositions of quasi-orthogonal coherent states, non-local entangled states of two resonators and multi-qubit GHZ states can be efficiently achieved by this gate.
In this paper the geometry of two-qubit systems under local unitary group $SO(2)\otimes SU(2)$ is discussed. It is shown that the quaternionic conformal map intertwines between this local unitary subgroup of $Sp(2)$ and the quaternionic Möbius transformation which is rather a generalization of the results of Lee et al (2002 Quantum Inf. Process. 1 129).
It is shown that Majorana fermions trapped in three vortices in a p-wave superfluid form a qubit in a topological quantum computing (TQC). Several similar ideas have already been proposed: Ivanov [Phys. Rev. Lett. {\bf 86}, 268 (2001)] and Zhang {\it et al.} [Phys. Rev. Lett. {\bf 99}, 220502 (2007)] have proposed schemes in which a qubit is implemented with two and four Majorana fermions, respectively, where a qubit operation is performed by exchanging the positions of Majorana fermions. The set of gates thus obtained is a discrete subset of the relevant unitary group. We propose, in this pap…
Mapping logical quantum circuits to Noisy Intermediate-Scale Quantum (NISQ) devices is a challenging problem which has attracted rapidly increasing interests from both quantum and classical computing communities. This paper proposes an efficient method by (i) selecting an initial mapping that takes into consideration the similarity between the architecture graph of the given NISQ device and a graph induced by the input logical circuit; and (ii) searching, in a filtered and depth-limited way, a most useful SWAP combination that makes executable as many as possible two-qubit gates in the logical…
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 chemistry and physics, quantum simulation is one of the great promises of the coming age of quantum computers. One challenge in realizing simulations on near-term quantum devices is the large number of qubits required by such mappings. In this work, we develop methods that allow us to trade-off qubit requirements against the complexity of the resulting quantum…
TRAM: A Transverse Relaxation Time-Aware Qubit Mapping Algorithm for NISQ Devices
College of Mathematics, Taiyuan University of Technology（太原理工大学数学学院）；Pawsey Supercomputing Research Centre（珀斯超级计算研究中心）；Department of Physics, The University of Western Australia（西澳大利亚大学物理系）
Quantum computing devices in the NISQ era share common features and challenges like limited connectivity between qubits. Since two-qubit gates are allowed on limited qubit pairs, quantum compilers must transform original quantum programs to fit the hardware constraints. Previous works on qubit mapping assume different gates have the same execution duration, which limits them to explore the parallelism from the program. To address this drawback, we propose a Multi-architecture Adaptive Quantum Abstract Machine (maQAM) and a COntext-sensitive and Duration-Aware Remapping algorithm (CODAR). The C…
Qubits are neither fermions nor bosons. A Fock space description of qubits leads to a mapping from qubits to parafermions: particles with a hybrid boson-fermion quantum statistics. We study this mapping in detail, and use it to provide a classification of the algebras of operators acting on qubits. These algebras in turn classify the universality of different classes of physically relevant qubit-qubit interaction Hamiltonians. The mapping is further used to elucidate the connections between qubits, bosons, and fermions. These connections allow us to share universality results between the diffe…
We consider a macroscopic quantum system such as a qubit, interacting with a bath of fermions as in the Fröhlich polaron model. The interaction Hamiltonian is thus linear in the macroscopic system variable, and bilinear in the fermions. Using the recently developed extension of Feynman-Vernon theory to non-harmonic baths we evaluate quadratic and the quartic terms in the influence action. We find that for this model the quartic term vanish by symmetry arguments. Although the influence of the bath on the system is of the same form as from bosonic harmonic oscillators up to effects to sixth orde…
We show that the general Heisenberg Hamiltonian with non-uniform couplings can be characterised by mapping the entanglement it generates as a function of time. Identification of the Hamiltonian in this way is possible as the coefficients of each operator control the oscillation frequencies of the entanglement function. The number of measurements required to achieve a given precision in the Hamiltonian parameters is determined and an efficient measurement strategy designed. We derive the relationship between the number of measurements, the resulting precision and the ultimate discrete error pro…
We propose to periodically modulate the onsite energy via two-tone drives, which can be furthermore used to engineer artificial gauge potential. As an example, we show that the fermionic ladder model penetrated with effective magnetic flux can be constructed by superconducting flux qubits using such two-tone-drive-engineered artificial gauge potential. In this superconducting system, the single-particle ground state can range from vortex phase to Meissner phase due to the competition between the interleg coupling strength and the effective magnetic flux. We also present the method to experimen…
We construct a canonical form for pure states in $\bwe^3(\bC^6)$, the three-fermion system with six single particle states, under local unitary (LU) transformations, i.e., the unitary group $\Un(6)$. We also construct a minimal set of generators of the algebra of polynomial $\Un(6)$-invariants on $\bwe^3(\bC^6)$. It turns out that this algebra is isomorphic to the algebra of polynomial LU-invariants of three-qubits which are additionally invariant under qubit permutations. As a consequence of this surprising fact, we deduce that there is a one-to-one correspondence between the $\Un(6)$-orbits …
We obtain the analytical expression for the Kraus decomposition of the quantum map of an environment modeled by an arbitrary quadratic fermionic Hamiltonian acting on one or two qubits, and derive simple functions to check the non-positivity of the intermediate map. These functions correspond to two different sufficient criteria for non-Markovianity. In the particular case of an environment represented by the Ising Hamiltonian, we discuss the two sources of non-Markovianity in the model, one due to the finite size of the lattice, and another due to the kind of interactions.
We discuss encodings of fermionic many-body systems by qubits in the presence of symmetries. Such encodings eliminate redundant degrees of freedom in a way that preserves a simple structure of the system Hamiltonian enabling quantum simulations with fewer qubits. First we consider $U(1)$ symmetry describing the particle number conservation. Using a previously known encoding based on the first quantization method a system of $M$ fermi modes with $N$ particles can be simulated on a quantum computer with $Q=N\log{(M)}$ qubits. We propose a new version of this encoding tailored to variational quan…
The Turaev-Viro invariants are scalar topological invariants of three-dimensional manifolds. Here we show that the problem of estimating the Fibonacci version of the Turaev-Viro invariant of a mapping torus is a complete problem for the one clean qubit complexity class (DQC1). This complements a previous result showing that estimating the Turaev-Viro invariant for arbitrary manifolds presented as Heegaard splittings is a complete problem for the standard quantum computation model (BQP). We also discuss a beautiful analogy between these results and previously known results on the computational …
One of the key compilation steps in Quantum Computing (QC) is to determine an initial logical to physical mapping of the qubits used in a quantum circuit. The impact of the starting qubit layout can vastly affect later scheduling and placement decisions of QASM operations, yielding higher values on critical performance metrics (gate count and circuit depth) as a result of quantum compilers introducing SWAP operations to meet the underlying physical neighboring and connectivity constraints of the quantum device. In this paper we introduce a novel qubit mapping approach, string-based qubit mappi…
Exterior calculus with its three operations meet, join and hodge star complement, is used for the representation of fermion-hole systems and for fermionic analogues of logical gates. Two different schemes that implement fermionic quantum computation, are proposed. The first scheme compares fermionic gates with Boolean gates, and leads to novel electronic devices that simulate fermionic gates. The second scheme usesa well known map between fermionic and multi-qubit systems, to simulate fermionic gates within multi-qubit systems.
We define a model of quantum computation with local fermionic modes (LFMs) -- sites which can be either empty or occupied by a fermion. With the standard correspondence between the Foch space of $m$ LFMs and the Hilbert space of $m$ qubits, simulation of one fermionic gate takes $O(m)$ qubit gates and vice versa. We show that using different encodings, the simulation cost can be reduced to $O(\log m)$ and a constant, respectively. Nearest-neighbors fermionic gates on a graph of bounded degree can be simulated at a constant cost. A universal set of fermionic gates is found. We also study comput…
Molecular simulations with the variational quantum eigensolver (VQE) are a promising application for emerging noisy intermediate-scale quantum computers. Constructing accurate molecular ansätze that are easy to optimize and implemented by shallow quantum circuits is crucial for the successful implementation of such simulations. Ansätze are, generally, constructed as series of fermionic-excitation evolutions. Instead, we demonstrate the usefulness of constructing ansätze with "qubit-excitation evolutions", which, contrary to fermionic excitation evolutions, obey "qubit commutation relations". W…
For quantum computing applications, the electronic Hamiltonian for the electronic structure problem needs to be unitarily transformed to a qubit form. We found that mean-field procedures on the original electronic Hamiltonian and on its transformed qubit counterpart can give different results. We establish conditions of when fermionic and qubit mean fields provide the same or different energies. In cases when the fermionic mean-field (Hartree-Fock) approach provides an accurate description (electronic correlation effects are small), the choice of molecular orbitals for the electron Hamiltonian…
An important approach to the fault-tolerant quantum computation is protecting the logical information using the quantum error correction. Usually, the logical information is in the form of logical qubits, which are encoded in physical qubits using quantum error correction codes. Compared with the qubit quantum computation, the fermionic quantum computation has advantages in quantum simulations of fermionic systems, e.g. molecules. In this paper, we show that the fermionic quantum computation can be universal and fault-tolerant if we encode logical Majorana fermions in physical Majorana fermion…
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as well as the NOT gate and multiply-controlled-Z gates, we describe a systematic approach to identifying the set of U(2) rotations required to implement each gate for any qudit of size N and with minimal use of an ancilla level. The qudit gates are analyzed in terms of the total rotation count and gate depth as the system scales with D. We apply the qudit-basi…
Sandia National Laboratories（桑迪亚国家实验室）；DAMTP, Centre for Mathematical Sciences, University of Cambridge（剑桥大学数学科学中心 DAMTP）；Department of Physics and Astronomy, Dartmouth College（达特茅斯学院物理与天文学系）；Joint Center for Quantum Information and Computer Science, University of Maryland（马里兰大学量子信息与计算科学联合中心）；School of Physics, University of Sydney（悉尼大学物理学院）；Department of Chemistry, Rice University（莱斯大学化学系）；Department of Physics and Astronomy, Rice University（莱斯大学物理与天文学系）；Department of Computer Science, University of Oxford（牛津大学计算机科学系）
Quantum simulations of fermionic many-body systems crucially rely on mappings from indistinguishable fermions to distinguishable qubits. The non-local structure of fermionic Fock space necessitates encodings that either map local fermionic operators to non-local qubit operators, or encode the fermionic representation in a long-range entangled code space. In this latter case, there is an unavoidable trade-off between two desirable properties of the encoding: low weight representations of local fermionic operators, and a high distance code space. Here it is argued that despite this fundamental l…
