Imagen de Portada

IQPopt: Fast optimization of instantaneous quantum polynomial circuits in JAX

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Armengol, Erik, Bowles, Joseph
Formato:	Preprint
Publicado:	2025
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Train on classical, deploy on quantum: scaling generative quantum machine learning to a thousand qubits
por: Recio-Armengol, Erik, et al.
Publicado: (2025)

Backpropagation scaling in parameterised quantum circuits
por: Bowles, Joseph, et al.
Publicado: (2023)

Probing instantaneous quantum circuit refrigeration in the quantum regime
por: Nakamura, Shuji, et al.
Publicado: (2024)

Shallow instantaneous quantum polynomial-time circuits for generative modeling on noisy intermediate-scale quantum hardware
por: Balló-Gimbernat, Oriol, et al.
Publicado: (2025)

IQP Born Machines under Data-dependent and Agnostic Initialization Strategies
por: Lerch, Sacha, et al.
Publicado: (2026)

Surrogate optimization of variational quantum circuits
por: Gustafson, Erik J., et al.
Publicado: (2024)

Single-shot quantum machine learning
por: Recio-Armengol, Erik, et al.
Publicado: (2024)

Fast gradient-free optimization of excitations in variational quantum eigensolvers
por: Jäger, Jonas, et al.
Publicado: (2024)

Riemannian quantum circuit optimization for Hamiltonian simulation
por: Kotil, Ayse, et al.
Publicado: (2022)

Automated quantum circuit optimization with randomized replacements
por: Szyniszewski, Marcin, et al.
Publicado: (2026)

Better than classical? The subtle art of benchmarking quantum machine learning models
por: Bowles, Joseph, et al.
Publicado: (2024)

Connecting quantum circuit amplitudes and matrix permanents through polynomials
por: Thomas, Hugo, et al.
Publicado: (2024)

Learning complexity gradually in quantum machine learning models
por: Recio-Armengol, Erik, et al.
Publicado: (2024)

Exponential-to-polynomial scaling of measurement overhead in circuit knitting via quantum tomography
por: Harada, Hiroyuki, et al.
Publicado: (2025)

Riemannian quantum circuit optimization based on matrix product operators
por: Le, Isabel Nha Minh, et al.
Publicado: (2025)

Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits
por: Ding, Cheng-Yun, et al.
Publicado: (2025)

Pulse-based variational quantum optimization and metalearning in superconducting circuits
por: Wang, Yapeng, et al.
Publicado: (2024)

Riemannian optimization of photonic quantum circuits in phase and Fock space
por: Yao, Yuan, et al.
Publicado: (2022)

Information scrambling and entanglement in quantum approximate optimization algorithm circuits
por: Qian, Chen, et al.
Publicado: (2023)

Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians
por: Morisaki, Hayata, et al.
Publicado: (2023)

A polynomial-time classical algorithm for noisy quantum circuits
por: Schuster, Thomas, et al.
Publicado: (2024)

Highly optimized quantum circuits synthesized via data-flow engines
por: Rakyta, Peter, et al.
Publicado: (2022)

Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits
por: Qi, Shuo, et al.
Publicado: (2025)

Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits
por: Zhu, Xuhao, et al.
Publicado: (2025)

Robust multi-mode superconducting circuit optimized for quantum information processing
por: García-Azorín, P., et al.
Publicado: (2024)

Quantum circuit optimization for arbitrary high-dimensional bipartite quantum computation
por: Jiang, Gui-Long, et al.
Publicado: (2026)

Probabilistic tensor optimization of quantum circuits for the max-$k$-cut problem
por: Paradezhenko, G. V., et al.
Publicado: (2023)

Synthesizing Toffoli-optimal quantum circuits for arbitrary multi-qubit unitaries
por: Mukhopadhyay, Priyanka
Publicado: (2024)

Learning quantum states prepared by shallow circuits in polynomial time
por: Landau, Zeph, et al.
Publicado: (2024)

Improving initial-state-dependent quantum circuit optimization by introducing state labels
por: Kaji, Toshiaki, et al.
Publicado: (2025)

Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
por: Cichy, Simon, et al.
Publicado: (2025)

A joint optimization approach of parameterized quantum circuits with a tensor network
por: Cores, Clara Ferreira, et al.
Publicado: (2024)

Spectral methods: crucial for machine learning, natural for quantum computers?
por: Belis, Vasilis, et al.
Publicado: (2026)

Learning to rank quantum circuits for hardware-optimized performance enhancement
por: Hartnett, Gavin S., et al.
Publicado: (2024)

Scalable circuit depth reduction in feedback-based quantum optimization with a quadratic approximation
por: Arai, Don, et al.
Publicado: (2024)

Pre-optimization of quantum circuits, barren plateaus and classical simulability: tensor networks to unlock the variational quantum eigensolver
por: Martin, Baptiste Anselme, et al.
Publicado: (2026)

Depth optimization of CNOT ladder circuits
por: Tserkis, Spyros, et al.
Publicado: (2025)

Asymptotically optimal synthesis of reversible circuits
por: Li, Xian Wu Lvzhou
Publicado: (2023)

Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
por: Nagies, Sebastian, et al.
Publicado: (2024)

Efficient and optimal quantum state discrimination via quantum belief propagation
por: Piveteau, Christophe, et al.
Publicado: (2025)