Guardado en:
| Autor principal: | Shao, Changpeng |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2604.10428 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
The Harrow-Hassidim-Lloyd algorithm with qutrits
por: Patel, Tushti, et al.
Publicado: (2025)
por: Patel, Tushti, et al.
Publicado: (2025)
Quantum resources in Harrow-Hassidim-Lloyd algorithm
por: Kumar, Pradeep, et al.
Publicado: (2023)
por: Kumar, Pradeep, et al.
Publicado: (2023)
Iterative Harrow-Hassidim-Lloyd quantum algorithm for solving resonances with eigenvector continuation
por: Zhang, Hantao, et al.
Publicado: (2025)
por: Zhang, Hantao, et al.
Publicado: (2025)
Enhancing the Harrow-Hassidim-Lloyd (HHL) algorithm in systems with large condition numbers
por: Tsemo, Peniel Bertrand, et al.
Publicado: (2024)
por: Tsemo, Peniel Bertrand, et al.
Publicado: (2024)
Studying few cluster resonances with quantum neural network driven iterative Harrow-Hassidim-Lloyd algorithm
por: Zhang, Hantao, et al.
Publicado: (2025)
por: Zhang, Hantao, et al.
Publicado: (2025)
Solving the Hele-Shaw flow using the Harrow-Hassidim-Lloyd algorithm on superconducting devices: A study of efficiency and challenges
por: Meena, Muralikrishnan Gopalakrishnan, et al.
Publicado: (2024)
por: Meena, Muralikrishnan Gopalakrishnan, et al.
Publicado: (2024)
Two Variations of Quantum Phase Estimation for Reducing Circuit Error Rates: Application to the Harrow--Hassidim--Lloyd Algorithm
por: Lee, Yonghae, et al.
Publicado: (2025)
por: Lee, Yonghae, et al.
Publicado: (2025)
Lower bounds for quantum-inspired classical algorithms via communication complexity
por: Mande, Nikhil S., et al.
Publicado: (2024)
por: Mande, Nikhil S., et al.
Publicado: (2024)
Robustness of quantum algorithms: Worst-case fidelity bounds and implications for design
por: Berberich, Julian, et al.
Publicado: (2025)
por: Berberich, Julian, et al.
Publicado: (2025)
Quantum algorithms for spectral sums
por: Luongo, Alessandro, et al.
Publicado: (2020)
por: Luongo, Alessandro, et al.
Publicado: (2020)
Testing quantum satisfiability
por: Montanaro, Ashley, et al.
Publicado: (2023)
por: Montanaro, Ashley, et al.
Publicado: (2023)
A discrete Fourier transform based quantum circuit for modular multiplication in Shor's algorithm
por: Patoary, Abu Musa, et al.
Publicado: (2025)
por: Patoary, Abu Musa, et al.
Publicado: (2025)
Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks
por: Niedermeier, Marcel, et al.
Publicado: (2023)
por: Niedermeier, Marcel, et al.
Publicado: (2023)
Quantum and classical query complexities of functions of matrices
por: Montanaro, Ashley, et al.
Publicado: (2023)
por: Montanaro, Ashley, et al.
Publicado: (2023)
Pauli path simulations of noisy quantum circuits beyond average case
por: González-García, Guillermo, et al.
Publicado: (2024)
por: González-García, Guillermo, et al.
Publicado: (2024)
Quantum spectral method for gradient and Hessian estimation
por: Zhang, Yuxin, et al.
Publicado: (2024)
por: Zhang, Yuxin, et al.
Publicado: (2024)
Single-copy stabilizer learning: average case and worst case
por: Cho, Gyungmin, et al.
Publicado: (2026)
por: Cho, Gyungmin, et al.
Publicado: (2026)
A novel quantum circuit for the quantum Fourier transform
por: Romero, Juan M., et al.
Publicado: (2025)
por: Romero, Juan M., et al.
Publicado: (2025)
Variational noise mitigation in quantum circuits: the case of Quantum Fourier Transform
por: Gómez-Lurbe, Rafael, et al.
Publicado: (2025)
por: Gómez-Lurbe, Rafael, et al.
Publicado: (2025)
Geometry of Kirkwood-Dirac classical states: A case study based on discrete Fourier transform
por: Yang, Ying-Hui, et al.
Publicado: (2024)
por: Yang, Ying-Hui, et al.
Publicado: (2024)
Exponential Lindbladian fast forwarding and exponential amplification of certain Gibbs state properties
por: Shang, Zhong-Xia, et al.
Publicado: (2025)
por: Shang, Zhong-Xia, et al.
Publicado: (2025)
Short-time quantum Fourier transform processing
por: Nair, Sreeraj Rajindran, et al.
Publicado: (2025)
por: Nair, Sreeraj Rajindran, et al.
Publicado: (2025)
T-count optimization of approximate quantum Fourier transform
por: Park, Byeongyong, et al.
Publicado: (2022)
por: Park, Byeongyong, et al.
Publicado: (2022)
On the average-case complexity of learning output distributions of quantum circuits
por: Nietner, Alexander, et al.
Publicado: (2023)
por: Nietner, Alexander, et al.
Publicado: (2023)
Quantum singular value transformation without block encodings: Near-optimal complexity with minimal ancilla
por: Chakraborty, Shantanav, et al.
Publicado: (2025)
por: Chakraborty, Shantanav, et al.
Publicado: (2025)
Low-degree approximation of QAC$^0$ circuits
por: Montanaro, Ashley, et al.
Publicado: (2024)
por: Montanaro, Ashley, et al.
Publicado: (2024)
Multiphoton interference in quantum Fourier transform circuits and applications to quantum metrology
por: Su, Zu-En, et al.
Publicado: (2017)
por: Su, Zu-En, et al.
Publicado: (2017)
Fault-tolerant execution of error-corrected quantum algorithms
por: Perlin, Michael A., et al.
Publicado: (2026)
por: Perlin, Michael A., et al.
Publicado: (2026)
The cost of quantum algorithms for biochemistry: A case study in metaphosphate hydrolysis
por: LaRose, Ryan, et al.
Publicado: (2026)
por: LaRose, Ryan, et al.
Publicado: (2026)
Description and error analysis of quantum alghorithms in the projection evolution model -- the Deutsch algorithm case
por: Lider, Krzysztof, et al.
Publicado: (2026)
por: Lider, Krzysztof, et al.
Publicado: (2026)
Transpiling quantum circuits by a transformers-based algorithm
por: Banfi, Michele, et al.
Publicado: (2025)
por: Banfi, Michele, et al.
Publicado: (2025)
Electro-optic Fourier transform chronometry of pulsed quantum light
por: Golestani, Ali, et al.
Publicado: (2022)
por: Golestani, Ali, et al.
Publicado: (2022)
Highly-efficient quantum Fourier transformations for some nonabelian groups
por: Murairi, Edison M., et al.
Publicado: (2024)
por: Murairi, Edison M., et al.
Publicado: (2024)
Implementing multi-controlled X gates using the quantum Fourier transform
por: Arsoski, Vladimir V.
Publicado: (2024)
por: Arsoski, Vladimir V.
Publicado: (2024)
Exponential improvements to the average-case hardness of BosonSampling
por: Bouland, Adam, et al.
Publicado: (2024)
por: Bouland, Adam, et al.
Publicado: (2024)
Fast Fourier transforms and fast Wigner and Weyl functions in large quantum systems
por: Lei, C., et al.
Publicado: (2024)
por: Lei, C., et al.
Publicado: (2024)
On the average-case complexity of learning states from the circular and Gaussian ensembles
por: West, Maxwell
Publicado: (2026)
por: West, Maxwell
Publicado: (2026)
On computational complexity and average-case hardness of shallow-depth boson sampling
por: Go, Byeongseon, et al.
Publicado: (2024)
por: Go, Byeongseon, et al.
Publicado: (2024)
A log-depth in-place quantum Fourier transform that rarely needs ancillas
por: Kahanamoku-Meyer, Gregory D., et al.
Publicado: (2025)
por: Kahanamoku-Meyer, Gregory D., et al.
Publicado: (2025)
The exact lower bound of CNOT-complexity for fault-tolerant quantum Fourier transform
por: Xia, Qiqing, et al.
Publicado: (2024)
por: Xia, Qiqing, et al.
Publicado: (2024)
Ejemplares similares
-
The Harrow-Hassidim-Lloyd algorithm with qutrits
por: Patel, Tushti, et al.
Publicado: (2025) -
Quantum resources in Harrow-Hassidim-Lloyd algorithm
por: Kumar, Pradeep, et al.
Publicado: (2023) -
Iterative Harrow-Hassidim-Lloyd quantum algorithm for solving resonances with eigenvector continuation
por: Zhang, Hantao, et al.
Publicado: (2025) -
Enhancing the Harrow-Hassidim-Lloyd (HHL) algorithm in systems with large condition numbers
por: Tsemo, Peniel Bertrand, et al.
Publicado: (2024) -
Studying few cluster resonances with quantum neural network driven iterative Harrow-Hassidim-Lloyd algorithm
por: Zhang, Hantao, et al.
Publicado: (2025)