Halving the cost of quantum multiplexed rotations
- URL: http://arxiv.org/abs/2110.13439v1
- Date: Tue, 26 Oct 2021 06:49:44 GMT
- Title: Halving the cost of quantum multiplexed rotations
- Authors: Guang Hao Low
- Abstract summary: We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls.
Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We improve the number of $T$ gates needed for a $b$-bit approximation of a
multiplexed quantum gate with $c$ controls applying $n$ single-qubit arbitrary
phase rotations from $4n b+\mathcal{O}(\sqrt{cn b})$ to $2n
b+\mathcal{O}(\sqrt{cn b})$, and reduce the number of qubits needed by up to a
factor of two. This generic quantum circuit primitive is found in many quantum
algorithms, and our results roughly halve the cost of state-of-art electronic
structure simulations based on qubitization of double-factorized or
tensor-hypercontracted representations. We achieve this by extending recent
ideas on stochastic compilation of quantum circuits to classical data and
discuss space-time trade-offs and concentration of measure in its
implementation.
Related papers
- Calculating response functions of coupled oscillators using quantum phase estimation [40.31060267062305]
We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer.
Our proposed quantum algorithm operates in the standard $s-sparse, oracle-based query access model.
We show that a simple adaptation of our algorithm solves the random glued-trees problem in time.
arXiv Detail & Related papers (2024-05-14T15:28:37Z) - 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) - Classical variational optimization of PREPARE circuit for quantum phase
estimation of quantum chemistry Hamiltonians [0.8009842832476994]
We propose a method for constructing $textttPREPARE$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry.
The $textttPREPARE$ circuit generates a quantum state which encodes the coefficients of the terms in the Hamiltonian as probability amplitudes.
arXiv Detail & Related papers (2023-08-26T05:32:38Z) - Efficient parallelization of quantum basis state shift [0.0]
We optimize the state shift algorithm by incorporating the shift in different directions in parallel.
This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods.
We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
arXiv Detail & Related papers (2023-04-04T11:01:08Z) - Shallow quantum circuits for efficient preparation of Slater
determinants and correlated states on a quantum computer [0.0]
Fermionic ansatz state preparation is a critical subroutine in many quantum algorithms such as Variational Quantum Eigensolver for quantum chemistry and condensed matter applications.
Inspired by data-loading circuits developed for quantum machine learning, we propose an alternate paradigm that provides shallower, yet scalable $mathcalO(d log2N)$ two-qubit gate depth circuits to prepare such states with d-fermions.
arXiv Detail & Related papers (2023-01-18T12:43:18Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - 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) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - 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) - Communication Cost of Quantum Processes [49.281159740373326]
A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer.
An important problem is to determine the minimum amount of communication needed to specify the desired computation.
We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
arXiv Detail & Related papers (2020-02-17T08:51:42Z)
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.