arXiv subjects

Michal Hajdusek

Publications and source records attributed to Michal Hajdusek.

4 recordsLinked to original sources

arXiv2026

Performance Analysis of QAOA Across Distributed Quantum Network Topologies Using SwitchQNet

Quantum data-center (QDC) architectures aim to scale distributed quantum computing (DQC) by interconnecting multiple quantum processing units (QPUs), but their performance depends strongly on how algorithmic communication patterns interact with entanglement generation, switch reconfiguration, and network topology. This paper studies the Quantum Approximate Optimization Algorithm (QAOA) as a graph-structured optimization workload for QDC-based distributed quantum computing. We adapt QAOA to SwitchQNet, a distributed quantum compiler framework that schedules communication and entanglement generation over switch-based QDC networks, by adding a routing generator that converts graph-dependent two-qubit cost interactions into remote-CX communication requests across QPUs. Using this extension, we evaluate QAOA instances across Clos, fat-tree, and spine-leaf topologies, measuring communication latency, EPR-pair overhead, EPR wait time, retry overhead, and sensitivity to buffer size, look-ahead depth, communication-qubit count, EPR latency, and EPR fidelity assumptions. The results show that QAOA obtains modest but consistent latency reductions, highlighting its value as a diagnostic benchmark for studying the interaction between algorithm structure, entanglement management, and quantum-network architecture.

quant-ph↗

arXiv2017

Self-guaranteed measurement-based quantum computation

In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling effects, unexpected noise, or unaccounted correlations between several subsystems. If we do not trust the measurement basis nor the prepared entangled state, we do need to be worried about such uncertainties. To this end, we proposes a "self-guaranteed" protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis nor entangled state) are needed. The approach we present enables the implementation of verifiable quantum computation using the measurement-based model in the context of a particular instance of delegated quantum computation where the server prepares the initial computational resource and sends it to the client who drives the computation by single-qubit measurements. Applying self-testing procedures we are able to verify the initial resource as well as the operation of the quantum devices, and hence the computation itself. The overhead of our protocol scales as the size of the initial resource state to the power of 4 times the natural logarithm of the initial state's size.

quant-ph↗

arXiv2013

A comparison of old and new definitions of the geometric measure of entanglement

Several inequivalent definitions of the geometric measure of entanglement (GM) have been introduced and studied in the past. Here we review several known and new definitions, with the qualifying criterion being that for pure states the measure is a linear or logarithmic function of the maximal fidelity with product states. The entanglement axioms and properties of the measures are studied, and qualitative and quantitative comparisons are made between all definitions. Streltsov et al. [New J. Phys 12 123004 (2010)] proved the equivalence of two linear definitions of GM, whereas we show that the corresponding logarithmic definitions are distinct. Certain classes of states such as "maximally correlated states" and isotropic states are particularly valuable for this analysis. A little-known GM definition is found to be the first one to be both normalized and weakly monotonous, thus being a prime candidate for future studies of multipartite entanglement. We also find that a large class of graph states, which includes all cluster states, have a "universal" closest separable state that minimizes the quantum relative entropy, the Bures distance and the trace distance.

quant-ph↗

arXiv2009

Entanglement in pure and thermal cluster states

We present a closest separable state to cluster states. We start by considering linear cluster chains and extend our method to cluster states that can be used as a universal resource in quantum computation. We reproduce known results for pure cluster states and show how our method can be used in quantifying entanglement in noisy cluster states. Operational meaning is given to our method that clearly demonstrates how these closest separable states can be constructed from two-qubit clusters in the case of pure states. We also discuss the issue of finding the critical temperature at which the cluster state becomes only classically correlated and the importance of this temperature to our method.

quant-ph↗