Minimally Universal Parity Quantum Computing

• URL: http://arxiv.org/abs/2504.03556v1
• Date: Fri, 04 Apr 2025 16:05:34 GMT
• Title: Minimally Universal Parity Quantum Computing
• Authors: Isaac D. Smith, Berend Klaver, Hendrik Poulsen Nautrup, Wolfgang Lechner, Hans J. Briegel,
• Abstract summary: In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits.<n>Here, we demonstrate that the answer is one, if the number of logical qubits is even, and two otherwise.<n>This leads to a variety of different universal parity gate sets corresponding to different numbers of auxiliary qubits.
• Score: 0.559239450391449
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native gate set. One might then wonder: what is the smallest number of auxiliary qubits that still allows for universal parity computing? Here, we demonstrate that the answer is one, if the number of logical qubits is even, and two otherwise. Furthermore, we present a sufficient condition for a given parity gate set to be universal. This leads to a variety of different universal parity gate sets corresponding to different numbers of auxiliary qubits, and more generally contributes to the understanding of which entangling gates are required to augment the set of single-qubit unitaries to perform universal quantum computing. As a consequence, we obtain (i) minimal implementations of the parity framework on e.g., a triangular lattice, (ii) hardware specific implementations of the parity flow framework on e.g., a heavy-hex lattice, and (iii) novel universal resources for measurement-based quantum computation (MBQC).

Related papers

• Universal approximation of continuous functions with minimal quantum circuits [1.1999555634662633]
  We provide a constructive method to approximate arbitrary multivariate functions using just a single qubit and a fixed-generator parametrization.<n>We also prove universality for a few of alternative fixed encoding strategies which may have independent interest.
  arXiv  Detail & Related papers  (2024-11-28T13:52:43Z)
• Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers [0.0]
  We propose feasible quantum arithmetic logic units (QALUs) for near-term quantum computers with qubits arranged in two-dimensional arrays. We introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.
  arXiv  Detail & Related papers  (2024-08-13T01:49:58Z)
• 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)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Quantum Circuit Completeness: Extensions and Simplifications [44.99833362998488]
  The first complete equational theory for quantum circuits has only recently been introduced. We simplify the equational theory by proving that several rules can be derived from the remaining ones. The complete equational theory can be extended to quantum circuits with ancillae or qubit discarding.
  arXiv  Detail & Related papers  (2023-03-06T13:31:27Z)
• Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls [62.997667081978825]
  We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
  arXiv  Detail & Related papers  (2022-12-09T12:59:44Z)
• 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)
• Applications of Universal Parity Quantum Computation [0.0]
  We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model. Embedding these algorithms in the parity encoding reduces the circuit depth compared to conventional gate-based implementations. We propose simple implementations of multiqubit gates in tailored encodings and an efficient strategy to prepare graph states.
  arXiv  Detail & Related papers  (2022-05-19T12:31:46Z)
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis [0.8367938108534343]
  We determine the minimum number of two-qubit CNOT gates needed to perform quantum state preparation and unitary operator synthesis for few-qubit systems. We find that there are a large number of configurations that all produce the desired result, even at the minimum number of gates. In addition to treating the general case of arbitrary target states or unitary operators, we apply the numerical approach to the special case of synthesizing the multi-qubit Toffoli gate.
  arXiv  Detail & Related papers  (2022-04-28T14:20:21Z)
• Representation matching for delegated quantum computing [64.67104066707309]
  representation matching is a generic probabilistic protocol for reducing the cost of quantum computation in a quantum network. We show that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks.
  arXiv  Detail & Related papers  (2020-09-14T18:07:43Z)
• 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)
• Topological Quantum Compiling with Reinforcement Learning [7.741584909637626]
  We introduce an efficient algorithm that compiles an arbitrary single-qubit gate into a sequence of elementary gates from a finite universal set. Our algorithm may carry over to other challenging quantum discrete problems, thus opening up a new avenue for intriguing applications of deep learning in quantum physics.
  arXiv  Detail & Related papers  (2020-04-09T18: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.