Quantum circuit for multi-qubit Toffoli gate with optimal resource
- URL: http://arxiv.org/abs/2402.05053v1
- Date: Wed, 7 Feb 2024 17:53:21 GMT
- Title: Quantum circuit for multi-qubit Toffoli gate with optimal resource
- Authors: Junhong Nie, Wei Zi, Xiaoming Sun
- Abstract summary: We design new quantum circuits for the $n$-Toffoli gate and general multi-controlled unitary, which have only $O(log n)$-depth and $O(n)$-size.
We demonstrate that without the assistance of ancillary qubit, any quantum circuit implementation of multi-qubit Toffoli gate must employ exponential precision gates.
- Score: 6.727984016678534
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Resource consumption is an important issue in quantum information processing,
particularly during the present NISQ era. In this paper, we investigate
resource optimization of implementing multiple controlled operations, which are
fundamental building blocks in the field of quantum computing and quantum
simulation. We design new quantum circuits for the $n$-Toffoli gate and general
multi-controlled unitary, which have only $O(\log n)$-depth and $O(n)$-size,
and only require $1$ ancillary qubit. To achieve these results, we explore the
potential of ancillary qubits and discover a method to create new conditional
clean qubits from existed ancillary qubits. These techniques can also be
utilized to construct an efficient quantum circuit for incrementor, leading to
an implementation of multi-qubit Toffoli gate with a depth of $O(\log^2n)$ and
size of $O(n)$ without any ancillary qubits. Furthermore, we explore the power
of ancillary qubits from the perspective of resource theory. We demonstrate
that without the assistance of ancillary qubit, any quantum circuit
implementation of multi-qubit Toffoli gate must employ exponential precision
gates. This finding indicates a significant disparity in computational power of
quantum circuits between using and not using ancillary qubits. Additionally, we
discuss the comparison of the power of ancillary qubits and extra energy levels
in quantum circuit design.
Related papers
- 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) - Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Shallow Quantum Circuit Implementation of Symmetric Functions with Limited Ancillary Qubits [5.9862846364925115]
In quantum computation, optimizing depth and number of ancillary qubits in quantum circuits is crucial.
This paper presents an innovative approach to implementing arbitrary symmetric Boolean functions using poly-logarithmic depth quantum circuits.
The key technique involves a novel poly-logarithmic depth quantum circuit designed to compute Hamming weight without the need for ancillary qubits.
arXiv Detail & Related papers (2024-04-09T06:30:54Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Classical variational optimization of PREPARE circuit for quantum phase
estimation of quantum chemistry Hamiltonians [0.8009842832476994]
We propose a method for constructing $textttPREPARE$ circuits for quantum phase estimation of a molecular Hamiltonian in quantum chemistry.
The $textttPREPARE$ circuit generates a quantum state which encodes the coefficients of the terms in the Hamiltonian as probability amplitudes.
arXiv Detail & Related papers (2023-08-26T05:32:38Z) - A single $T$-gate makes distribution learning hard [56.045224655472865]
This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits.
We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
arXiv Detail & Related papers (2022-07-07T08:04:15Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Linear-depth quantum circuits for multiqubit controlled gates [3.0001636668817606]
We present a systematic procedure to decompose multiqubit controlled unitary gates.
We show the advantage of our algorithm with proof-of-principle experiments on the IBM quantum cloud platform.
arXiv Detail & Related papers (2022-03-22T16:57:59Z) - Quantum State Preparation with Optimal Circuit Depth: Implementations
and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits.
We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z) - 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) - 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)
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.