Effective non-local parity-dependent couplings in qubit chains

• URL: http://arxiv.org/abs/2203.07331v1
• Date: Mon, 14 Mar 2022 17:33:40 GMT
• Title: Effective non-local parity-dependent couplings in qubit chains
• Authors: Maximilian N\"agele, Christian Schweizer, Federico Roy and Stefan Filipp
• Abstract summary: We harness the simultaneous coupling of qubits on a chain and engineer a set of non-local parity-dependent quantum operations. The resulting effective long-range couplings directly implement a parametrizable Trotter-step for Jordan-Wigner fermions. We present numerical simulations of the gate operation in a superconducting quantum circuit architecture.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: For the efficient implementation of quantum algorithms, practical ways to generate many-body entanglement are a basic requirement. Specifically, coupling multiple qubit pairs at once can be advantageous and can lead to multi-qubit operations useful in the construction of hardware-tailored algorithms. Here we harness the simultaneous coupling of qubits on a chain and engineer a set of non-local parity-dependent quantum operations suitable for a wide range of applications. The resulting effective long-range couplings directly implement a parametrizable Trotter-step for Jordan-Wigner fermions and can be used for simulations of quantum dynamics, efficient state generation in variational quantum eigensolvers, parity measurements for error-correction schemes, and the generation of efficient multi-qubit gates. Moreover, we present numerical simulations of the gate operation in a superconducting quantum circuit architecture, which show a high gate fidelity of $>99.9\%$ for realistic experimental parameters.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Implementing multi-controlled X gates using the quantum Fourier transform [0.0]
  We show how a quantum arithmetic-based approach can be efficiently used to implement many complex quantum gates. We show how the depth of the circuit can be significantly reduced using only a few ancilla qubits.
  arXiv  Detail & Related papers  (2024-07-25T13:22:00Z)
• Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs [1.0749601922718608]
  Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms. We introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits.
  arXiv  Detail & Related papers  (2024-04-03T15:42:25Z)
• Scalable multi-qubit intrinsic gates in quantum dot arrays [0.0]
  The intrinsic quantum gates refer to the class of natural-forming transformations in the qubit rotating-frame under direct exchange coupling. We develop a general formalism for identifying the multi-qubit intrinsic gates under arbitrary array connectivity. The applications of the intrinsic gates in quantum computing and quantum error correction are explored.
  arXiv  Detail & Related papers  (2024-03-11T16:49:56Z)
• Machine-learning-inspired quantum optimal control of nonadiabatic geometric quantum computation via reverse engineering [3.3216171033358077]
  We propose a promising average-fidelity-based machine-learning-inspired method to optimize the control parameters. We implement a single-qubit gate by cat-state nonadiabatic geometric quantum computation via reverse engineering. We demonstrate that the neural network possesses the ability to expand the model space.
  arXiv  Detail & Related papers  (2023-09-28T14:36:26Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum amplitude damping for solving homogeneous linear differential equations: A noninterferometric algorithm [0.0]
  This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs. We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
  arXiv  Detail & Related papers  (2021-11-10T11:25:32Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.