Qubit Reduction and Quantum Speedup for Wireless Channel Assignment
Problem
- URL: http://arxiv.org/abs/2208.05181v2
- Date: Tue, 1 Aug 2023 08:55:54 GMT
- Title: Qubit Reduction and Quantum Speedup for Wireless Channel Assignment
Problem
- Authors: Yuki Sano, Masaya Norimoto, Naoki Ishikawa
- Abstract summary: We propose a novel method of formulating an NP-hard wireless channel assignment problem as a higher-order unconstrained binary optimization (HUBO)
We conceive ascending and descending binary encodings of the channel indices, construct a specific quantum circuit, and derive the exact numbers of qubits and gates required by Grover adaptive search (GAS)
Our analysis clarifies that the proposed HUBO formulation significantly reduces the number of qubits and the query complexity compared with the conventional quadratic formulation.
- Score: 2.840363325289377
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: In this paper, we propose a novel method of formulating an NP-hard wireless
channel assignment problem as a higher-order unconstrained binary optimization
(HUBO), where the Grover adaptive search (GAS) is used to provide a quadratic
speedup for solving the problem. The conventional method relies on a one-hot
encoding of the channel indices, resulting in a quadratic formulation. By
contrast, we conceive ascending and descending binary encodings of the channel
indices, construct a specific quantum circuit, and derive the exact numbers of
qubits and gates required by GAS. Our analysis clarifies that the proposed HUBO
formulation significantly reduces the number of qubits and the query complexity
compared with the conventional quadratic formulation. This advantage is
achieved at the cost of an increased number of quantum gates, which we
demonstrate can be reduced by our proposed descending binary encoding.
Related papers
- Quantum Speedup of the Dispersion and Codebook Design Problems [6.735173690339397]
Dispersion problems are optimization problems classified as NP-hard.
We propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm.
arXiv Detail & Related papers (2024-06-11T12:00:50Z) - Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies with Higher-Order Formulations [2.9564164925541503]
Grover adaptive search (GAS) is a quantum exhaustive search algorithm designed to solve binary optimization problems.
We propose higher-order binary formulations that can simultaneously reduce the numbers of qubits and required gates.
arXiv Detail & Related papers (2023-08-03T07:20:24Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Quantum-inspired optimization for wavelength assignment [51.55491037321065]
We propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem.
Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications.
arXiv Detail & Related papers (2022-11-01T07:52:47Z) - 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) - Quantum Speedup for Higher-Order Unconstrained Binary Optimization and
MIMO Maximum Likelihood Detection [2.5272389610447856]
We propose a quantum algorithm that supports a real-valued higher-order unconstrained binary optimization problem.
The proposed algorithm is capable of reducing the query complexity in the classical domain and providing a quadratic speedup in the quantum domain.
arXiv Detail & Related papers (2022-05-31T00:14:49Z) - Optimal qubit assignment and routing via integer programming [0.22940141855172028]
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity.
We model this problem as an integer linear program, using a network flow formulation with binary variables.
We consider several cost functions: an approximation of the fidelity of the circuit, its total depth, and a measure of cross-talk.
arXiv Detail & Related papers (2021-06-11T15:02:26Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - A QUBO Formulation for Qubit Allocation [0.0]
present-day quantum computers have a limited number of qubits, connectivity constraints, and varying gate fidelities.
In this work we formulate and implement the qubit placement problem as a quadratic, unconstrained binary optimization (QUBO) problem and solve it using simulated annealing to obtain a spectrum of initial placements.
Compared to contemporary allocation methods available in t|ket$rangle $ and Qiskit, the QUBO method yields allocations with improved circuit depth for $>$50% of a large set of benchmark circuits, with many also requiring fewer CX gates.
arXiv Detail & Related papers (2020-08-31T23:06:23Z)
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.