Symmetry-Conserving Quantum Approximate Optimization Algorithm (SCom-QAOA) Circuits for Efficient Preparation of Entangled Quantum States
SCom-QAOA circuits, optimized using the Quantum Natural Gradient, offer an efficient method for preparing entangled quantum states, with circuit depth scaling dependent on the spectral gap of the target state's Hamiltonian.
Feynman Path Integral Inspired Approach to Quantum Circuit Optimization via Entanglement Minimization
Minimizing the cumulative entanglement changes throughout a quantum circuit's execution, referred to as the "path-entanglement sum," is likely to lead to more optimal circuit designs.
GUOQ: A Novel Quantum Circuit Optimization Algorithm Combining Rewrite Rules and Unitary Synthesis
Combining fast rewrite rules with slower but more powerful unitary synthesis techniques in a randomized search algorithm significantly outperforms existing quantum circuit optimizers.
Layout-Aware n-Bit Toffoli Gates for IBM Quantum Computers: A Bloch Sphere Approach
This paper proposes a novel, cost-effective design for n-bit Toffoli gates on IBM quantum computers, called "layout-aware n-bit Toffoli gates," which minimizes quantum cost by leveraging the Bloch sphere visualization and IBM's native gate set.
Hardware-Tailored Diagonalization Circuits for Efficient Quantum Expectation Value Estimation on Near-Term Quantum Computers
This article introduces a novel framework for designing hardware-tailored quantum circuits that efficiently diagonalize Pauli operators, thereby reducing the number of measurements needed to estimate expectation values on quantum computers with limited connectivity.
Improving Quantum Circuit Optimization through Enhanced Peephole Synthesis and Error-Aware Recombination
Peephole optimization of quantum circuits can be significantly improved by incorporating error-aware recombination techniques and cascaded error estimation, leading to more noise-resilient approximate quantum circuits.
© 2024 by Linnk AI