Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Theoretical Physics

Perturbations Can Enhance Quantum Search

Joonwoo Bae, Younghun Kwon

Published Sep 1, 2003• 3 citations
Publisher
DOI
10.1023/a:1027343321366

Related papers

Quantum Mechanical Search and Harmonic Perturbation

Jie-Hong Roland Jiang, Dah-Wei Chiou, Cheng-En R. Wu

arXiv:quant-ph/0702007•Quantum Information Processing•Sep 19, 2007•1 citation

Degenerate perturbation theory to quantum search

Dezheng Zhang, Xuanmin Zhu, Yuanchun Deng +3 more

arXiv:2311.07856•Quantum Information Processing•Mar 26, 2024•1 citation

Enhanced quantum searching via entanglement and partial diffusion

Ahmed Younes, Jonathan E. Rowe, Julian Francis Miller

arXiv:quant-ph/0406207•Physica D Nonlinear Phenomena•Jan 2, 2008•29 citations

Perturbations can enhance qauntum search

Joonwoo Bae, Younghun Kwon

In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. In this letter, we will supply the answer to the interesting question: can the factors seemingly harmful to a quantum algorithm(for example, perturbations) enhance the algorithm? We show that some perturbations to the generalized quantum search Hamiltonian can reduce the running time and enhance the success probability. We also provide the narrow bound to the perturbation which can be beneficial to quantum search. In addition, we show that the error induced by a perturbation on the Farhi and Gutmann Hamiltonian can be corrected by another perturbation.

arXiv:quant-ph/0211186•Nov 28, 2002•0 citations

Differentiable Architecture Search for Adversarially Robust Quantum Computer Vision

Mohamed Afane, Quanjiang Long, Haoting Shen +4 more

Current quantum neural networks suffer from extreme sensitivity to both adversarial perturbations and hardware noise, creating a significant barrier to real-world deployment. Existing robustness techniques typically sacrifice clean accuracy or require prohibitive computational resources. We propose a hybrid quantum-classical Differentiable Quantum Architecture Search (DQAS) framework that addresses these limitations by jointly optimizing circuit structure and robustness through gradient-based methods. Our approach enhances traditional DQAS with a lightweight Classical Noise Layer applied before quantum processing, enabling simultaneous optimization of gate selection and noise parameters. This design preserves the quantum circuit's integrity while introducing trainable perturbations that enhance robustness without compromising standard performance. Experimental validation on MNIST, FashionMNIST, and CIFAR datasets shows consistent improvements in both clean and adversarial accuracy compared to existing quantum architecture search methods. Under various attack scenarios, including Fast Gradient Sign Method (FGSM), Projected Gradient Descent (PGD), Basic Iterative Method (BIM), and Momentum Iterative Method (MIM), and under realistic quantum noise conditions, our hybrid framework maintains superior performance. Testing on actual quantum hardware confirms the practical viability of discovered architectures. These results demonstrate that strategic classical preprocessing combined with differentiable quantum architecture optimization can significantly enhance quantum neural network robustness while maintaining computational efficiency.

quant-pharXiv:2601.18058•Quantum Machine Intelligence•Jan 27, 2026•2 citations

Quantum Probability Perturbation Algorithm

Jincheng Zhang

This paper introduces a novel quantum probability perturbation algorithm designed to optimize quantum system parameters and enhance quantum system performance. The algorithm leverages the principles of quantum superposition and entanglement to induce random perturbations within the system, facilitating a systematic search for optimal configurations. Traditional optimization methods often rely on manual parameter tuning, while this algorithm provides an automated approach to parameter refinement. The core mechanism involves manipulating quantum states through probabilistic interactions, ultimately leading to improved system performance. This work presents a framework for enhancing quantum system capabilities through intelligent parameter adjustments.

•Sep 4, 2026•0 citations
In general, a quantum algorithm wants to avoid decoherence or perturbation, since such factors may cause errors in the algorithm. In this letter, we will supply the answer to the interesting question: can the factors seemingly harmful to a quantum algorithm(for example, perturbations) enhance the algorithm? We show that some perturbations to the generalized quantum search Hamiltonian can reduce the running time and enhance the success probability. We also provide the narrow bound to the perturbation which can be beneficial to quantum search. In addition, we show that the error induced by a perturbation on the Farhi and Gutmann Hamiltonian can be corrected by another perturbation.
Current quantum neural networks suffer from extreme sensitivity to both adversarial perturbations and hardware noise, creating a significant barrier to real-world deployment. Existing robustness techniques typically sacrifice clean accuracy or require prohibitive computational resources. We propose a hybrid quantum-classical Differentiable Quantum Architecture Search (DQAS) framework that addresses these limitations by jointly optimizing circuit structure and robustness through gradient-based methods. Our approach enhances traditional DQAS with a lightweight Classical Noise Layer applied before quantum processing, enabling simultaneous optimization of gate selection and noise parameters. This design preserves the quantum circuit's integrity while introducing trainable perturbations that enhance robustness without compromising standard performance. Experimental validation on MNIST, FashionMNIST, and CIFAR datasets shows consistent improvements in both clean and adversarial accuracy compared to existing quantum architecture search methods. Under various attack scenarios, including Fast Gradient Sign Method (FGSM), Projected Gradient Descent (PGD), Basic Iterative Method (BIM), and Momentum Iterative Method (MIM), and under realistic quantum noise conditions, our hybrid framework maintains superior performance. Testing on actual quantum hardware confirms the practical viability of discovered architectures. These results demonstrate that strategic classical preprocessing combined with differentiable quantum architecture optimization can significantly enhance quantum neural network robustness while maintaining computational efficiency.
This paper introduces a novel quantum probability perturbation algorithm designed to optimize quantum system parameters and enhance quantum system performance. The algorithm leverages the principles of quantum superposition and entanglement to induce random perturbations within the system, facilitating a systematic search for optimal configurations. Traditional optimization methods often rely on manual parameter tuning, while this algorithm provides an automated approach to parameter refinement. The core mechanism involves manipulating quantum states through probabilistic interactions, ultimately leading to improved system performance. This work presents a framework for enhancing quantum system capabilities through intelligent parameter adjustments.