Efficient multi-qubit subspace rotations via topological quantum walks
- URL: http://arxiv.org/abs/2111.06534v2
- Date: Thu, 3 Mar 2022 11:38:44 GMT
- Title: Efficient multi-qubit subspace rotations via topological quantum walks
- Authors: Xiu Gu, Jonathan Allcock, Shuoming An, Yu-xi Liu
- Abstract summary: The rotation of subspaces by a chosen angle is a fundamental quantum computing operation.
We propose a fast, high-fidelity way to implement such operations via topological quantum walks.
This procedure can be implemented in superconducting qubits, ion-traps and Rydberg atoms with star-type connectivity.
- Score: 1.0486921990935787
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The rotation of subspaces by a chosen angle is a fundamental quantum
computing operation, with applications in error correction and quantum
algorithms such as the Quantum Approximate Optimization Algorithm, the
Variational Quantum Eigensolver and the quantum singular value transformation.
Such rotations are usually implemented at the hardware level via
multiple-controlled-phase gates, which lead to large circuit depth when
decomposed into one- and two-qubit gates. Here, we propose a fast,
high-fidelity way to implement such operations via topological quantum walks,
where a sequence of single-qubit $z$ rotations of an ancilla qubit are
interleaved with the evolution of a system Hamiltonian in which a matrix $A$ is
embedded. The subspace spanned by the left or right singular vectors of $A$
with non-zero singular values is rotated, depending on the state of the
ancilla. This procedure can be implemented in superconducting qubits, ion-traps
and Rydberg atoms with star-type connectivity, significantly reducing the total
gate time required compared to previous proposals.
Related papers
- Geodesic Algorithm for Unitary Gate Design with Time-Independent
Hamiltonians [1.9106435311144372]
We present an algorithm that finds the strengths of the Hamiltonian terms by using the direction of the geodesic to the target quantum gate.
We numerically compare our algorithm to gradient descent methods and show that it finds solutions with considerably fewer steps for standard multi-qubit gates.
arXiv Detail & Related papers (2024-01-11T15:20:16Z) - 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) - 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) - Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent
and Incoherent Photons Found with Gradient Search [77.34726150561087]
We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control.
We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
arXiv Detail & Related papers (2023-02-28T07:36:02Z) - Universal qudit gate synthesis for transmons [44.22241766275732]
We design a superconducting qudit-based quantum processor.
We propose a universal gate set featuring a two-qudit cross-resonance entangling gate.
We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
arXiv Detail & Related papers (2022-12-08T18:59:53Z) - Halving the cost of quantum multiplexed rotations [0.0]
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.
arXiv Detail & Related papers (2021-10-26T06:49:44Z) - 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) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - 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) - Computational advantage from quantum superposition of multiple temporal
orders of photonic gates [0.0]
A control quantum system can coherently determine the order in which a target quantum system undergoes $N$ gate operations.
We experimentally demonstrate the quantum $N$-switch with $N=4$ gates acting on a photonic-polarization qubit.
This is the first observation of a quantum superposition of more than $N=2$ temporal orders.
arXiv Detail & Related papers (2020-02-18T19:00:01Z)
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.