Logarithmic-Depth Quantum Circuits for Hamming Weight Projections
- URL: http://arxiv.org/abs/2404.07151v3
- Date: Thu, 24 Oct 2024 14:02:43 GMT
- Title: Logarithmic-Depth Quantum Circuits for Hamming Weight Projections
- Authors: Soorya Rethinasamy, Margarite L. LaBorde, Mark M. Wilde,
- Abstract summary: We propose several quantum algorithms that realize a coherent Hamming weight projective measurement on an input pure state.
We analyze a depth-width trade-off for the corresponding quantum circuits, allowing for a depth reduction of the circuits at the cost of more control qubits.
- Score: 3.481985817302898
- License:
- Abstract: A pure state of fixed Hamming weight is a superposition of computational basis states such that each bitstring in the superposition has the same number of ones. Given a Hilbert space of the form $\mathcal{H} = (\mathbb{C}_2)^{\otimes n}$, or an $n$-qubit system, the identity operator can be decomposed as a sum of projectors onto subspaces of fixed Hamming weight. In this work, we propose several quantum algorithms that realize a coherent Hamming weight projective measurement on an input pure state, meaning that the post-measurement state of the algorithm is the projection of the input state onto the corresponding subspace of fixed Hamming weight. We analyze a depth-width trade-off for the corresponding quantum circuits, allowing for a depth reduction of the circuits at the cost of more control qubits. For an $n$-qubit input, the depth-optimal algorithm uses $O(n)$ control qubits and the corresponding circuit has depth $O(\log (n))$, assuming that we have the ability to perform qubit resets. Furthermore, the proposed algorithm construction uses only one- and two-qubit gates.
Related papers
- Entanglement-Assisted Coding for Arbitrary Linear Computations Over a Quantum MAC [34.32444379837011]
We study a linear computation problem over a quantum multiple access channel (LC-QMAC)
We propose an achievable scheme for LC-QMAC based on the stabilizer formalism and the ideas from entanglement-assisted quantum error-correcting codes (EAQECC)
arXiv Detail & Related papers (2025-01-27T18:35:33Z) - Linear Circuit Synthesis using Weighted Steiner Trees [45.11082946405984]
CNOT circuits are a common building block of general quantum circuits.
This article presents state-of-the-art algorithms for optimizing the number of CNOT gates.
A simulated evaluation shows that the suggested is almost always beneficial and reduces the number of CNOT gates by up to 10%.
arXiv Detail & Related papers (2024-08-07T19:51:22Z) - Quantum encoder for fixed Hamming-weight subspaces [0.0]
We present an exact $n$-qubit computational-basis amplitude encoder of real- or complex-principle data vectors of $d=binomnk$ provided in analytical form.
We also perform an experimental proof-of-principle demonstration of our scheme on a commercial trapped-ion quantum computer.
arXiv Detail & Related papers (2024-05-30T18:26:41Z) - Purely quantum algorithms for calculating determinant and inverse of matrix and solving linear algebraic systems [43.53835128052666]
We propose quantum algorithms for the computation of the determinant and inverse of an $(N-1) times (N-1)$ matrix.
This approach is a straightforward modification of the existing algorithm for determining the determinant of an $N times N$ matrix.
We provide suitable circuit designs for all three algorithms, each estimated to require $O(N log N)$ in terms of space.
arXiv Detail & Related papers (2024-01-29T23:23:27Z) - A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.
The presented method is validated and demonstrated for 2D lid-driven cavity flow.
arXiv Detail & Related papers (2024-01-20T15:32:01Z) - QuIP: 2-Bit Quantization of Large Language Models With Guarantees [44.212441764241]
This work studies post-training parameter quantization in large language models (LLMs)
We introduce quantization with incoherence processing (QuIP), a new method based on the insight that quantization benefits from $textitincoherent$ weight and Hessian matrices.
arXiv Detail & Related papers (2023-07-25T07:44:06Z) - Training quantum neural networks using the Quantum Information
Bottleneck method [0.6768558752130311]
We provide a concrete method for training a quantum neural network to maximize the relevant information about a property that is transmitted through the network.
This is significant because it gives an operationally well founded quantity to optimize when training autoencoders for problems where the inputs and outputs are fully quantum.
arXiv Detail & Related papers (2022-12-05T21:11:32Z) - Digital-analog co-design of the Harrow-Hassidim-Lloyd algorithm [0.0]
Harrow-Hassidim-Lloyd quantum algorithm was proposed to solve linear systems of equations $Avecx = vecb$.
There is not an explicit quantum circuit for the subroutine which maps the inverse of the problem matrix $A$ into an ancillary qubit.
We present a co-designed quantum processor which reduces the depth of the algorithm.
arXiv Detail & Related papers (2022-07-27T13:58:13Z) - K-sparse Pure State Tomography with Phase Estimation [1.2183405753834557]
Quantum state tomography (QST) for reconstructing pure states requires exponentially increasing resources and measurements with the number of qubits.
QST reconstruction for any pure state composed of the superposition of $K$ different computational basis states of $n$bits in a specific measurement set-up is presented.
arXiv Detail & Related papers (2021-11-08T09:43:12Z) - Low-depth Quantum State Preparation [3.540171881768714]
A crucial subroutine in quantum computing is to load the classical data of $N$ complex numbers into the amplitude of a superposed $n=lceil logNrceil$-qubit state.
Here we investigate this space-time tradeoff in quantum state preparation with classical data.
We propose quantum algorithms with $mathcal O(n2)$ circuit depth to encode any $N$ complex numbers.
arXiv Detail & Related papers (2021-02-15T13:11:43Z) - Quantum Gram-Schmidt Processes and Their Application to Efficient State
Read-out for Quantum Algorithms [87.04438831673063]
We present an efficient read-out protocol that yields the classical vector form of the generated state.
Our protocol suits the case that the output state lies in the row space of the input matrix.
One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
arXiv Detail & Related papers (2020-04-14T11:05:26Z)
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.