Special-Purpose Quantum Processor Design
- URL: http://arxiv.org/abs/2102.01228v1
- Date: Mon, 1 Feb 2021 23:26:15 GMT
- Title: Special-Purpose Quantum Processor Design
- Authors: Bin-Han Lu, Yu-Chun Wu, Wei-Cheng Kong, Qi Zhou, and Guo-Ping Guo
- Abstract summary: Full connectivity of qubits is necessary for most quantum algorithms.
inserting swap gate to enable the two-qubit gates between uncoupled qubits significantly decreases the computation result fidelity.
We propose a Special-Purpose Quantum Processor Design method that can design suitable structures for different quantum algorithms.
- Score: 2.275405513780208
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Full connectivity of qubits is necessary for most quantum algorithms, which
is difficult to directly implement on Noisy Intermediate-Scale Quantum
processors. However, inserting swap gate to enable the two-qubit gates between
uncoupled qubits significantly decreases the computation result fidelity. To
this end, we propose a Special-Purpose Quantum Processor Design method that can
design suitable structures for different quantum algorithms. Our method extends
the processor structure from two-dimensional lattice graph to general planar
graph and arranges the physical couplers according to the two-qubit gate
distribution between the logical qubits of the quantum algorithm and the
physical constraints. Experimental results show that our design methodology,
compared with other methods, could reduce the number of extra swap gates per
two-qubit gate by at least 104.2% on average. Also, our method's advantage over
other methods becomes more obvious as the depth and qubit number increase. The
result reveals that our method is competitive in improving computation result
fidelity and it has the potential to demonstrate quantum advantage under the
technical conditions.
Related papers
- Codesigned counterdiabatic quantum optimization on a photonic quantum processor [6.079051215256144]
We focus on the counterdiabatic protocol with a codesigned approach to implement this algorithm on a photonic quantum processor.
We develop and implement an optimized counterdiabatic method by tackling the higher-order many-body interaction terms.
We experimentally demonstrate the advantages of a codesigned mapping of counterdiabatic quantum dynamics for quantum computing on photonic platforms.
arXiv Detail & Related papers (2024-09-26T15:08:19Z) - 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) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance.
Here we report on a strategy that can overcome such problems.
We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
arXiv Detail & Related papers (2023-08-04T13:39:46Z) - Hardware-Conscious Optimization of the Quantum Toffoli Gate [11.897854272643634]
This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level.
We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization.
Our optimized Toffoli gate implementation demonstrates an $18%$ reduction in infidelity compared with the canonical implementation.
arXiv Detail & Related papers (2022-09-06T17:29:22Z) - Quantum thermodynamic methods to purify a qubit on a quantum processing
unit [68.8204255655161]
We report on a quantum thermodynamic method to purify a qubit on a quantum processing unit equipped with identical qubits.
Our starting point is a three qubit design that emulates the well known two qubit swap engine.
We implement it on a publicly available superconducting qubit based QPU, and observe a purification capability down to 200 mK.
arXiv Detail & Related papers (2022-01-31T16:13:57Z) - Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions.
Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
arXiv Detail & Related papers (2021-06-24T20:16:02Z) - 2D Qubit Placement of Quantum Circuits using LONGPATH [1.6631602844999722]
Two algorithms are proposed to optimize the number of SWAP gates in any arbitrary quantum circuit.
Our approach has a significant reduction in number of SWAP gates in 1D and 2D NTC architecture.
arXiv Detail & Related papers (2020-07-14T04:09:52Z) - 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) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.