Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers
arXiv:2206.13040 · doi:10.1103/PhysRevA.107.062416
Abstract
Transformations which convert between Fermionic modes and qubit operations have become a ubiquitous tool in quantum algorithms for simulating systems. Similarly, collections of Pauli operators might be obtained from solutions of non-local games and satisfiability problems. Drawing on ideas from entanglement-assisted quantum error-correcting codes and quantum convolutional codes, we prove the obtainable lower-bound for the number of qubits needed to represent such Pauli operations which are equivalent and provide a procedure for determining such a set of minimal register Pauli operations.
arXiv comment5 pages, 0 figures. Comments welcome
References in corpus (16)
- Quantum Computing in the NISQ era and beyond
- Mixed State Entanglement and Quantum Error Correction
- Improved Simulation of Stabilizer Circuits
- Fermionic quantum computation
- Correcting Quantum Errors with Entanglement
- A random compiler for fast Hamiltonian simulation
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Optimal Entanglement Formulas for Entanglement-Assisted Quantum Coding
- Faster quantum simulation by randomization
- Towards simulating 2D effects in lattice gauge theories on a quantum computer
- A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
- Exploiting locality in quantum computation for quantum chemistry
- Optimal fermion-to-qubit mapping via ternary trees with applications to reduced quantum states learning
- Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
- Adaptive estimation of quantum observables
- Minimal-memory, non-catastrophic, polynomial-depth quantum convolutional encoders