Distributed Exact Quantum Amplitude Amplification Algorithm for Arbitrary Quantum States

• URL: http://arxiv.org/abs/2601.09128v1
• Date: Wed, 14 Jan 2026 03:54:27 GMT
• Title: Distributed Exact Quantum Amplitude Amplification Algorithm for Arbitrary Quantum States
• Abstract summary: In this study, we focus on the challenge of achieving exact amplitude amplification for quantum states with arbitrary amplitude distributions.<n>We propose a Distributed Exact Quantum Amplitude Amplification Algorithm (DEQAAA)<n>DEQAAA demonstrates remarkable advantages in both quantum gate count and circuit depth as the qubit number scales.
• Score: 3.6212098394171606
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the noisy intermediate-scale quantum (NISQ) era, distributed quantum computation has garnered considerable interest, as it overcomes the physical limitations of single-device architectures and enables scalable quantum information processing. In this study, we focus on the challenge of achieving exact amplitude amplification for quantum states with arbitrary amplitude distributions and subsequently propose a Distributed Exact Quantum Amplitude Amplification Algorithm (DEQAAA). Specifically, (1) it supports partitioning across any number of nodes $t$ within the range $2 \leq t \leq n$; (2) the maximum qubit count required for any single node is expressed as $\max \left(n_0,n_1,\dots,n_{t-1} \right) $, where $n_j$ represents the number of qubits at the $j$-th node, with $\sum_{j=0}^{t-1} n_j =n$; (3) it can realize exact amplitude amplification for multiple targets of a quantum state with arbitrary amplitude distributions; (4) we verify the effectiveness of DEQAAA by resolving a specific exact amplitude amplification task involving two targets (8 and 14 in decimal) via MindSpore Quantum, a quantum simulation software, with tests conducted on 4-qubit, 6-qubit, 8-qubit and 10-qubit systems. Notably, through the decomposition of $C^{n-1}PS$ gates, DEQAAA demonstrates remarkable advantages in both quantum gate count and circuit depth as the qubit number scales, thereby boosting its noise resilience. In the 10-qubit scenario, for instance, it achieves a reduction of over $97\%$ in both indicators compared to QAAA and EQAAA, underscoring its outstanding resource-saving performance.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Quantum Detection of Sequency-Band Structure [0.5729426778193398]
  We present a quantum algorithm for estimating the amplitude content of user-specified sequency bands in quantum-encoded signals.<n>The method employs a sequency-ordered Quantum Walsh-Hadamard Transform (QWHT), a comparator-based oracle that coherently marks basis states within an arbitrary sequency range.<n>This enables the detection of structured signal components, including both high- and low-sequency features, as well as the identification of rapid sign-change behavior associated with noise or anomalies.
  arXiv  Detail & Related papers  (2026-02-09T08:47:51Z)
• Shallow quantum circuit for generating O(1)-entangled approximate state designs [6.161617062225404]
  We find a new ensemble of quantum states that serve as an $epsilon$-approximate state $t$-design while possessing extremely low entanglement, magic, and coherence.<n>These resources can reach their theoretical lower bounds, $Omega(log (t/epsilon))$, which are also proven in this work.<n>A class of quantum circuits proposed in our work offers reduced cost for classical simulation of random quantum states.
  arXiv  Detail & Related papers  (2025-07-23T18:56:19Z)
• Hadamard Random Forest: Reconstructing real-valued quantum states with exponential reduction in measurement settings [1.857570444541311]
  We introduce a readout method for real-valued quantum states that reduces measurement settings required for state vector reconstruction to $O(N_mathrmq)$.<n>We experimentally validate our method up to 10 qubits on the latest available IBM quantum processor and demonstrate that it accurately extracts key properties such as entanglement and magic.
  arXiv  Detail & Related papers  (2025-05-09T22:12:54Z)
• Implementation and readout of maximally entangled two-qubit gates quantum circuits in a superconducting quantum processor [32.40607221598716]
  In a transmon-based 5-qubit superconducting quantum processor, we compared the performance of quantum circuits involving an increasing level of complexity.<n>Here we report the results obtained from the analysis of the outputs of quantum circuits using two readout paradigms.<n>The first method is suitable for single-qubit circuits, while the second is essential for accurately interpreting the outputs of circuits involving two-qubit gates.
  arXiv  Detail & Related papers  (2025-03-31T16:20:56Z)
• Purest Quantum State Identification [14.22473588576799]
  We introduce the purest quantum state identification, which can be used to improve the accuracy of quantum computation and communication.<n>For incoherent strategies, we derive the first adaptive algorithm achieving error probability $expleft(- Omegaleft(fracN H_1log(K) 2nfracright)$, fundamentally improving quantum property learning.
  arXiv  Detail & Related papers  (2025-02-20T07:42:16Z)
• Hybrid Oscillator-Qubit Quantum Processors: Simulating Fermions, Bosons, and Gauge Fields [31.51988323782987]
  We develop a hybrid oscillator-qubit processor framework for quantum simulation of strongly correlated fermions and bosons. This framework gives exact decompositions of particle interactions as well as approximate methods based on the Baker-Campbell Hausdorff formulas. While our work focusses on an implementation in superconducting hardware, our framework can also be used in trapped ion, and neutral atom hardware.
  arXiv  Detail & Related papers  (2024-09-05T17:58:20Z)
• Entanglement-induced exponential advantage in amplitude estimation via state matrixization [11.282486674587236]
  Estimating quantum amplitude, or the overlap between two quantum states, is a fundamental task in quantum computing.<n>We introduce a novel algorithmic framework for quantum amplitude estimation by transforming pure states into their matrix forms.<n>We reconstruct amplitude estimation algorithms within the novel matrixization framework through a technique known as channel block encoding.
  arXiv  Detail & Related papers  (2024-08-25T04:35:53Z)
• A Logarithmic Depth Quantum Carry-Lookahead Modulo $(2^n-1)$ Adder [0.8192907805418581]
  Development of quantum arithmetic circuits for modulo addition is vital for implementing quantum algorithms. Current Noisy Intermediate Scale Quantum (NISQ) era quantum computers cannot handle the additional computational cost associated with fault-tolerant designs. This work presents quantum carry-lookahead modulo $(2n - 1)$ adder (QCLMA), which is designed to receive two n-bit numbers and perform their addition with an O(log n) depth.
  arXiv  Detail & Related papers  (2024-08-02T04:31:22Z)
• Modular quantum processor with an all-to-all reconfigurable router [34.39074227074929]
  We propose a high-speed on-chip quantum processor that supports reconfigurable all-to-all coupling with a large on-off ratio. We demonstrate reconfigurable controlled-Z gates across all qubit pairs, with a benchmarked average fidelity of $96.00%pm0.08%$. We also generate multi-qubit entanglement, distributed across the separate modules, demonstrating GHZ-3 and GHZ-4 states with fidelities of $88.15%pm0.24%$ and $75.18%pm0.11%$, respectively.
  arXiv  Detail & Related papers  (2024-07-29T16:02:03Z)
• A Novel Quantum-Classical Hybrid Algorithm for Determining Eigenstate Energies in Quantum Systems [1.9714447272714082]
  This paper presents a novel quantum algorithm, XZ24, for efficiently computing the eigen-energy spectra of arbitrary quantum systems. XZ24 has three key advantages: It removes the need for eigenstate preparation, requiring only a reference state with non-negligible overlap. It enables simultaneous computation of multiple eigen-energies, depending on the reference state.
  arXiv  Detail & Related papers  (2024-06-01T04:31:43Z)
• Distributed Exact Generalized Grover's Algorithm [9.675088142486729]
  We propose a distributed Exactized Grover's Algorithm (DEGGA) to solve a generalized search problem. Our algorithm ensures accuracy, with a theoretical probability of identifying the target states at $100%$. Our method requires a total of $n$ qubits, eliminating the need for auxiliary qubits.
  arXiv  Detail & Related papers  (2024-05-11T09:17:11Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion string: Realizing basic quantum algorithms [29.67699443799741]
  We demonstrate a quantum processor based on a 3D linear Paul trap that uses $171$Yb$+$ ions with 8 individually controllable four-level qudits (ququarts) The design of the developed ion trap provides high secular, low heating rate, which, together with individual addressing and readout optical systems, allows executing quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-05T15:48:43Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications [10.436969366019015]
  We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits. We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
  arXiv  Detail & Related papers  (2022-01-27T13:16:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.