Hardware-Tailored Diagonalization Circuits

Abstract

A central building block of many quantum algorithms is the diagonalization of Pauli operators. Although it is always possible to construct a quantum circuit that simultaneously diagonalizes a given set of commuting Pauli operators, only resource-efficient circuits can be executed reliably on near-term quantum computers. Generic diagonalization circuits, in contrast, often lead to an unaffordable Swap gate overhead on quantum devices with limited hardware connectivity. A common alternative is to exclude two-qubit gates altogether. However, this comes at the severe cost of restricting the class of diagonalizable sets of Pauli operators to tensor product bases (TPBs). In this article, we introduce a theoretical framework for constructing hardware-tailored (HT) diagonalization circuits. Our framework establishes a systematic and highly flexible procedure for tailoring diagonalization circuits with ultra-low gate counts. We highlight promising use cases of our framework and - as a proof-of-principle application - we devise an efficient algorithm for grouping the Pauli operators of a given Hamiltonian into jointly-HT-diagonalizable sets. For several classes of Hamiltonians, we observe that our approach requires fewer measurements than conventional TPB approaches. Finally, we experimentally demonstrate that HT circuits can improve the efficiency of estimating expectation values with cloud-based quantum computers.

8+6 pages, 5 figures, 3 tables. The article has been restructured for clarity. Supplementary Material is available upon request

References in corpus (35)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• The theory of variational hybrid quantum-classical algorithms
• Circuit Quantum Electrodynamics
• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum computational chemistry
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Logical quantum processor based on reconfigurable atom arrays
• Evaluating analytic gradients on quantum hardware
• Multi-party entanglement in graph states
• Semiconductor Spin Qubits
• Realizing Repeated Quantum Error Correction in a Distance-Three Surface Code
• Mitigating measurement errors in multi-qubit experiments
• The Future of Quantum Computing with Superconducting Qubits
• Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
• Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
• Stochastic gradient descent for hybrid quantum-classical optimization
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Efficient estimation of Pauli observables by derandomization
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Computational advantage of quantum random sampling
• Measurement reduction in variational quantum algorithms
• A variational toolbox for quantum multi-parameter estimation
• Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
• Efficient and feasible state tomography of quantum many-body systems
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• Efficient evaluation of quantum observables using entangled measurements
• Overlapped grouping measurement: A unified framework for measuring quantum states
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• Randomizing multi-product formulas for Hamiltonian simulation
• Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space
• Adaptive estimation of quantum observables
• Single-component gradient rules for variational quantum algorithms
• Hardware-efficient entangled measurements for variational quantum algorithms

Cited by in corpus (10)

• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Hamiltonian-based graph-state ansatz for variational quantum algorithms
• Practical techniques for high-precision measurements on near-term quantum hardware and applications in molecular energy estimation
• Measuring Correlation and Entanglement between Molecular Orbitals on a Trapped-Ion Quantum Computer
• State Specific Measurement Protocols for the Variational Quantum Eigensolver
• Mitigating the measurement overhead of ADAPT-VQE with optimised informationally complete generalised measurements
• Trotter error and gate complexity of the SYK and sparse SYK models
• Experimental measurement and a physical interpretation of quantum shadow enumerators
• Quantum-Enhanced Neural Exchange-Correlation Functionals