Resource Optimized Quantum Squaring Circuit
- URL: http://arxiv.org/abs/2406.01875v1
- Date: Tue, 4 Jun 2024 01:04:01 GMT
- Title: Resource Optimized Quantum Squaring Circuit
- Authors: Afrin Sultana, Edgard Muñoz-Coreas,
- Abstract summary: Quantum squaring operation is useful building block in implementing quantum algorithms.
Quantum circuits could be made fault-tolerant by using error correcting codes and fault-tolerant quantum gates.
In this paper, we present a novel integer squaring architecture optimized for T-count, CNOT-count, T-depth, CNOT-depth, and $KQ_T$ that produces no garbage outputs.
- Score: 0.7673339435080445
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum squaring operation is a useful building block in implementing quantum algorithms such as linear regression, regularized least squares algorithm, order-finding algorithm, quantum search algorithm, Newton Raphson division, Euclidean distance calculation, cryptography, and in finding roots and reciprocals. Quantum circuits could be made fault-tolerant by using error correcting codes and fault-tolerant quantum gates (such as the Clifford + T-gates). However, the T-gate is very costly to implement. Two qubit gates (such as the CNOT-gate) are more prone to noise errors than single qubit gates. Consequently, in order to realize reliable quantum algorithms, the quantum circuits should have a low T-count and CNOT-count. In this paper, we present a novel quantum integer squaring architecture optimized for T-count, CNOT-count, T-depth, CNOT-depth, and $KQ_T$ that produces no garbage outputs. To reduce costs, we use a novel approach for arranging the generated partial products that allows us to reduce the number of adders by 50%. We also use the resource efficient logical-AND gate and uncomputation gate shown in [1] to further save resources. The proposed quantum squaring circuit sees an asymptotic reduction of 66.67% in T-count, 50% in T-depth, 29.41% in CNOT-count, 42.86% in CNOT-depth, and 25% in KQ T with respect to Thapliyal et al. [2]. With respect to Nagamani et al. [3] the design sees an asymptotic reduction of 77.27% in T-count, 68.75% in T-depth, 50% in CNOT-count, 61.90% in CNOT-depth, and 6.25% in the $KQ_T$.
Related papers
- Optimizing Gate Decomposition for High-Level Quantum Programming [0.0]
Multi-controlled quantum gates naturally arise in high-level quantum programming.
This paper presents novel methods for optimizing multi-controlled quantum gates.
We demonstrate significant reductions in the number of CNOT gates.
arXiv Detail & Related papers (2024-06-08T21:36:08Z) - Quantum Circuit Optimization with AlphaTensor [47.9303833600197]
We develop AlphaTensor-Quantum, a method to minimize the number of T gates that are needed to implement a given circuit.
Unlike existing methods for T-count optimization, AlphaTensor-Quantum can incorporate domain-specific knowledge about quantum computation and leverage gadgets.
Remarkably, it discovers an efficient algorithm akin to Karatsuba's method for multiplication in finite fields.
arXiv Detail & Related papers (2024-02-22T09:20:54Z) - Error-corrected Hadamard gate simulated at the circuit level [42.002147097239444]
We simulate the logical Hadamard gate in the surface code under a circuit-level noise model.
Our paper is the first to do this for a unitary gate on a quantum error-correction code.
arXiv Detail & Related papers (2023-12-18T19:00:00Z) - Reqomp: Space-constrained Uncomputation for Quantum Circuits [4.703757073704313]
We present Reqomp, a method to automatically synthesize correct and efficient uncomputation of ancillae.
Our evaluation demonstrates that Reqomp can significantly reduce the number of required ancilla qubits by up to 96%.
arXiv Detail & Related papers (2022-12-20T16:23:04Z) - Automatic Depth-Optimized Quantum Circuit Synthesis for Diagonal Unitary
Matrices with Asymptotically Optimal Gate Count [9.194399933498323]
It is of great importance to optimize the depth/gate-count when designing quantum circuits for specific tasks.
In this paper, we propose a depth-optimized synthesis algorithm that automatically produces a quantum circuit for any given diagonal unitary matrix.
arXiv Detail & Related papers (2022-12-02T06:58:26Z) - Complexity-Theoretic Limitations on Quantum Algorithms for Topological
Data Analysis [59.545114016224254]
Quantum algorithms for topological data analysis seem to provide an exponential advantage over the best classical approach.
We show that the central task of TDA -- estimating Betti numbers -- is intractable even for quantum computers.
We argue that an exponential quantum advantage can be recovered if the input data is given as a specification of simplices.
arXiv Detail & Related papers (2022-09-28T17:53:25Z) - Software mitigation of coherent two-qubit gate errors [55.878249096379804]
Two-qubit gates are important components of quantum computing.
But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications.
We present two software methods to mitigate parasitic two-qubit gate errors.
arXiv Detail & Related papers (2021-11-08T17:37:27Z) - Quantum Instruction Set Design for Performance [30.049549820997996]
A quantum instruction set is where quantum hardware and software meet.
We develop new characterization and compilation techniques for non-Clifford gates to accurately evaluate different quantum instruction set designs.
arXiv Detail & Related papers (2021-05-13T04:39:33Z) - 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) - T-count and Qubit Optimized Quantum Circuit Designs of Carry Lookahead
Adder [0.966840768820136]
Quantum circuits of arithmetic operations such as addition are needed to implement quantum algorithms in hardware.
Quantum circuits based on Clifford+T gates are used as they can be made tolerant to noise.
The T-count performance measure has become important in quantum circuit design.
arXiv Detail & Related papers (2020-04-04T01:07:50Z) - Trading T gates for dirty qubits in state preparation and unitary synthesis [0.0]
We present a quantum algorithm for preparing any dimension-$N$ pure quantum state specified by a list of $N$ classical numbers.
Our scheme uses $mathcalO(fracNlambda+lambdalogfracNepsilonlogfraclogNepsilon)$ to reduce the T-gate cost to $mathcalO(fracNlambda+lambdalogfracNepsilonlogfraclogNepsilon)$
arXiv Detail & Related papers (2018-12-03T18:24:32Z)
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.