A Geometrical Design Tool for Building Cost-Effective Layout-Aware n-Bit Quantum Gates Using the Bloch Sphere Approach

• URL: http://arxiv.org/abs/2601.00484v1
• Date: Thu, 01 Jan 2026 21:35:26 GMT
• Title: A Geometrical Design Tool for Building Cost-Effective Layout-Aware n-Bit Quantum Gates Using the Bloch Sphere Approach
• Abstract summary: This paper introduces a new concept of using the Bloch sphere as a "geometrical design tool" to build cost-effective n-bit quantum gates with lower quantum costs.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The conventional design technique of any n-bit quantum gate is mainly achieved using unitary matrices multiplication, where n >= 2 and 1 <= m <= n-1 for m target qubits and n-m control qubits. These matrices represent quantum rotations by an n-bit quantum gate. For a quantum designer, such a conventional technique requires extensive computational time and effort, which may generate an n-bit quantum gate with a too high quantum cost. The Bloch sphere is only utilized as a visualization tool to verify the conventional design correctness for quantum rotations by a quantum gate. In contrast, this paper introduces a new concept of using the Bloch sphere as a "geometrical design tool" to build cost-effective n-bit quantum gates with lower quantum costs. This concept is termed the "Bloch sphere approach (BSA)". In BSA, a cost-effective n-bit quantum gate is built without using any unitary matrices multiplication. Instead, the quantum rotations for such a gate are visually selected using the geometrical planar intersections of the Bloch sphere. The BSA can efficiently map m targets among n-m controls for an n-bit quantum gate, to satisfy the limited layout connectivity for the physical neighboring qubits of a quantum computer. Experimentally, n-bit quantum gates built using the BSA always have lower quantum costs than those for such gates built using the conventional quantum design techniques.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Automatic De-Quantization of Quantum Programs Using Constant Propagation [42.89658025409898]
  Every quantum operation is costly, making it crucial to minimize quantum resource usage in near-term algorithms.<n>In this work, we focus on de-quantizing quantum operations to classical computation whenever possible.<n>We formalize a hybrid state model for quantum-classical constant propagation, implement our optimizations in the open-source MQT Core tool, and evaluate them on benchmark circuits.
  arXiv  Detail & Related papers  (2026-05-21T19:21:11Z)
• Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity [1.0360348400670518]
  We show that a minimal SWAP-gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
  arXiv  Detail & Related papers  (2024-02-01T10:32:05Z)
• 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.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Coupled vertical double quantum dots at single-hole occupancy [37.69303106863453]
  We control vertical double quantum dots confined in a double quantum well, silicon-germanium heterostructure. We sense individual charge transitions with a single-hole transistor. tuning the vertical double quantum dot to the (1,1) charge state confines a single hole in each quantum well beneath a single plunger gate.
  arXiv  Detail & Related papers  (2024-01-15T14:46:40Z)
• Non-adiabatic holonomies as photonic quantum gates [36.136619420474766]
  We present the quantum-optical realization of non-adiabatic holonomies that can be used as single-qubit quantum gates. The inherent non-adiabaticity of the structures paves the way for unprecedented miniaturization.
  arXiv  Detail & Related papers  (2024-01-08T16:44:45Z)
• GALA-n: Generic Architecture of Layout-Aware n-Bit Quantum Operators for Cost-Effective Realization on IBM Quantum Computers [0.0]
  A generic architecture of n-bit quantum operators is proposed for cost-effective transpilation. The proposed architecture is termed "GALA-n quantum operator" After transpilation, our proposed GALA-n quantum operator always has a lower transpilation quantum cost than that of conventional n-bit quantum operators.
  arXiv  Detail & Related papers  (2023-11-12T07:25:06Z)
• Super-compact universal quantum logic gates with inversedesigned elements [11.117677905657441]
  Integrated quantum photonic circuit is a promising platform for the realization of quantum information processing. We report the implementation of super-compact universal quantum logic gates on silicon chips by the method of inverse design. Our study paves the way for the realization of largescale quantum photonic chips with integrated sources, and can possess important applications in the field of quantum information processes.
  arXiv  Detail & Related papers  (2023-09-09T23:17:17Z)
• Several fitness functions and entanglement gates in quantum kernel generation [3.6953740776904924]
  Entanglement, a fundamental concept in quantum mechanics, assumes a central role in quantum computing. We investigate the optimal number of entanglement gates in the quantum kernel feature maps by a multi-objective genetic algorithm. Our findings offer valuable guidance for enhancing the efficiency and accuracy of quantum machine learning algorithms.
  arXiv  Detail & Related papers  (2023-08-22T18:35:51Z)
• 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)
• Monte Carlo Graph Search for Quantum Circuit Optimization [26.114550071165628]
  This work proposes a quantum architecture search algorithm based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order, both for discrete gates, as well as gates containing continuous variables.
  arXiv  Detail & Related papers  (2023-07-14T14:01:25Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Universal quantum multi-qubit entangling gates with auxiliary spaces [0.0]
  We present an effective quantum circuit for the implementation of a controlled-NOT (CNOT) gate. The method is extended to the construction of a general n-control-qubit Toffoli gate with (2n-1) qubit-qudit gates and (2n-2) single-qudit gates. Based on the presented quantum circuits, the polarization CNOT and Toffoli gates with linear optics are designed by operating on the spatial-mode degree of freedom of photons.
  arXiv  Detail & Related papers  (2021-05-22T03:30:22Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Programming a quantum computer with quantum instructions [39.994876450026865]
  We use a density matrixiation protocol to execute quantum instructions on quantum data. A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
  arXiv  Detail & Related papers  (2020-01-23T22:43:29Z)

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.