Related papers: Gate teleportation-assisted routing for quantum al…
Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage: In seminal work [Quantum Inf. Comput., 4(2):134--145], Terhal and DiVincenzo have shown that these…
As quantum computing resources remain scarce and error rates high, minimizing the resource consumption of quantum circuits is essential for achieving practical quantum advantage. Here we consider the natural problem of, given a circuit $C$,…
Entanglement routing establishes remote entanglement connection between two arbitrary nodes, which is one of the most important functions in quantum networks. The existing routing mechanisms mainly improve the robustness and throughput…
We present a two-level decomposition strategy for solving the Vehicle Routing Problem (VRP) using the Quantum Approximate Optimization Algorithm. A Problem-Level Decomposition partitions a 13-node (156-qubit) VRP into smaller Traveling…
The performance of shallow-depth quantum optimization algorithms is known to depend strongly on problem structure, yet the role of real-world network topology remains poorly understood. In this work, we study how urban graph structure…
Quantum computing is a promising technology to address combinatorial optimization problems, for example via the quantum approximate optimization algorithm (QAOA). Its potential, however, hinges on scaling toy problems to sizes relevant for…
Optimal Access Point (AP) selection is crucial for accurate indoor localization, yet it is constrained by budget, creating a trade-off between localization accuracy and deployment cost. Classical approaches to AP selection are often…
The Quantum Approximate Optimization Algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a…
Quantum Approximate Optimization Algorithms (QAOA) have demonstrated a strong potential in addressing graph-based optimization problems. However, the execution of large-scale quantum circuits remains constrained by the limitations of…
Due to the physics behind quantum computing, quantum circuit designers must adhere to the constraints posed by the limited interaction distance of qubits. Existing circuits need therefore to be modified via the insertion of SWAP gates,…
Quantum networks provide a novel framework for quantum information processing, significantly enhancing system capacity through the interconnection of modular quantum nodes. Beyond the capability to distribute quantum states, the ability to…
In many practical applications, quantum algorithms require several qubits, significantly more than those available with current noisy intermediate-scale quantum processors. Distributed quantum computing (DQC) is considered a scalable…
Effective access points (APs) selection is a crucial step in localization systems. It directly affects both localization accuracy and computational efficiency. Classical APs selection algorithms are usually computationally expensive,…
The performance of a quantum teleportation algorithm implemented on an ion trap quantum computer is investigated. First the algorithm is analyzed in terms of the teleportation fidelity of six input states evenly distributed over the Bloch…
Port-based teleportation (PBT) is a variant of quantum teleportation that, unlike the canonical protocol by Bennett et al., does not require a correction operation on the teleported state. Since its introduction by Ishizaka and Hiroshima in…
This paper addresses the path selection problem from a known source to the destination in dense networks. The proposed solution for route discovery uses the genetic algorithm approach for a QoS based network. The multi point crossover and…
The Tail Assignment Problem (TAP) is a critical optimization challenge in airline operations, requiring the optimal assignment of aircraft to scheduled flights to maximize efficiency and minimize costs. To address the TAP, this work applies…
Finding a Hadamard matrix of a specific order using a quantum computer can lead to a demonstration of practical quantum advantage. Earlier efforts using a quantum annealer were impeded by the limitations of the present quantum resource and…
We experimentally demonstrate a programmable quantum gate that applies a sign flip operation to data qubit in an arbitrary basis fully specified by the quantum state of a two-qubit program register. Our linear-optical implementation is…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…