Approximate separation of quantum gates and separation experiments of
CNOT based on Particle Swarm Optimization algorithm
- URL: http://arxiv.org/abs/2201.05786v1
- Date: Sat, 15 Jan 2022 08:10:22 GMT
- Title: Approximate separation of quantum gates and separation experiments of
CNOT based on Particle Swarm Optimization algorithm
- Authors: Kan He, Shusen Liu, Jinchuan Hou
- Abstract summary: Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system.
Main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates.
- Score: 1.4821822452801385
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Ying conceived of using two or more small-capacity quantum computers to
produce a larger-capacity quantum computing system by quantum parallel
programming ([M. S. Ying, Morgan-Kaufmann, 2016]). In doing so, the main
obstacle is separating the quantum gates in the whole circuit to produce a
tensor product of the local gates. It has been showed that there are few
separable multipartite quantum gates, so the approximate separation problem
involves finding local quantum gates that approximate a given inseparable gate.
We propose and study a problem involving the approximate separation of
multipartite gates based on quantum-gate fidelity. For given multipartite and
local gates, we conclude that the smaller is the maximal distance between the
products of an arbitrary pair of eigenvalues, the greater is their gate
fidelity. This provides a criterion for approximate separation. Lastly, we
discuss the optimal approximate separation of the CNOT gate.
Related papers
- Quantum circuit synthesis via a random combinatorial search [0.0]
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets.
We show that the fraction of perfect-fidelity quantum circuits increases rapidly as soon as the circuit size exceeds the minimum circuit size required for achieving unit fidelity.
arXiv Detail & Related papers (2023-11-29T00:59:29Z) - Quantum control landscape for generation of $H$ and $T$ gates in an open
qubit with both coherent and environmental drive [57.70351255180495]
An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$)
Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
arXiv Detail & Related papers (2023-09-05T09:05:27Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Optimizing the number of CNOT gates in one-dimensional nearest-neighbor
quantum Fourier transform circuit [0.0]
We construct a one-dimensional nearest-neighbor circuit of quantum Fourier transform (QFT)
It is found that our method reduces the number of CNOT gates by 60%.
Our results for the one-dimensional nearest-neighbor circuit can be applied to quantum amplitude estimation.
arXiv Detail & Related papers (2022-08-30T13:24:16Z) - Experimentally feasible computational advantage from quantum
superposition of gate orders [0.0]
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems.
The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state.
It is known that this quantum-controlled ordering of gates can reduce the query complexity in deciding a property of black-box unitaries with respect to the best algorithm in which gates are applied in a fixed order.
arXiv Detail & Related papers (2021-12-29T13:36:27Z) - Separation of gates in quantum parallel programming [1.4821822452801385]
Ying conceived of using two or more small-capacity quantum computers to produce a larger-capacity quantum computing system by quantum parallel programming.
Main obstacle is separating the quantum gates in the whole circuit to produce a tensor product of the local gates.
We theoretically analyse the (sufficient and necessary) separability conditions of multipartite quantum gates in finite or infinite dimensional systems.
arXiv Detail & Related papers (2021-10-28T09:11:41Z) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - 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) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - 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.