Quantum encoder for fixed Hamming-weight subspaces

Abstract

We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-valued data vectors of $d=\left(\genfrac{}{}{0ex}{}{n}{k}\right)$ components into a subspace of fixed Hamming weight $k$. This represents a polynomial space compression of degree $k$. The circuit is optimal in that it expresses an arbitrary data vector using only $d-1$ (controlled) Reconfigurable Beam Splitter (RBS) gates and is constructed by an efficient classical algorithm that sequentially generates all bitstrings of weight $k$ and identifies the gates that superpose the corresponding states with the correct amplitudes. An explicit compilation into CNOTs and single-qubit gates is presented, with the total CNOT-gate count of $\mathcal{O}(kd)$ provided in analytical form. In addition, we show how to load data in the binary basis by sequentially stacking encoders of different Hamming weights using $\mathcal{O}(d\log (d))$ CNOT gates. Moreover, using generalized RBS gates that mix states of different Hamming weights, we extend the construction to efficiently encode arbitrary sparse vectors. Experimentally, we perform a proof-of-principle demonstration of our scheme on a commercial trapped-ion quantum computer. We successfully upload a $q$-Gaussian probability distribution in the non-log-concave regime with $n=6$ and $k=2$. We also showcase how the effect of hardware noise can be alleviated by quantum error mitigation. Numerically, we show how our encoder can improve the performance of variational quantum algorithms for problems that include particle-preserving symmetries. Our results constitute a versatile framework for quantum data compression with various potential applications in fields such as quantum chemistry, quantum machine learning, and constrained combinatorial optimizations.

13 pages, 7 figures, 4 tables; Revised text + new subsections + new numerical data

References in corpus (19)

• Quantum error correction below the surface code threshold
• Synthesis of Quantum Logic Circuits
• Quantum-state preparation with universal gate decompositions
• A divide-and-conquer algorithm for quantum state preparation
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Qibo: a framework for quantum simulation with hardware acceleration
• A general framework for randomized benchmarking
• Quantum Vision Transformers
• Quantum Methods for Neural Networks and Application to Medical Image Classification
• Unified approach to data-driven quantum error mitigation
• Orbital-optimized pair-correlated electron simulations on trapped-ion quantum computers
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Towards large-scale quantum optimization solvers with few qubits
• Double sparse quantum state preparation
• Quantum Deep Hedging
• Efficient option pricing with unary-based photonic computing chip and generative adversarial learning
• Deterministic Bethe state preparation
• Characteristic Function of the Tsallis $q$-Gaussian and Its Applications in Measurement and Metrology
• Efficient quantum interpolation of natural data

Cited by in corpus (5)

• Bethe Ansatz, Quantum Circuits, and the F-basis
• Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
• Quantum states supported by matroids
• Spin-$s$ $U(1)$-eigenstate preparation
• Double-bracket quantum algorithms for high-fidelity ground state preparation