Searcharxiv⌕ Search

arXiv subjects

Michal Hajdušek

Publications and source records attributed to Michal Hajdušek.

At least 55 records · Page 3Linked to original sources
arXiv2022

Symmetries and Synchronization Blockade

Synchronization blockade refers to an interferometric cancellation of quantum synchronization. In this manuscript, we show how the choice of synchronization measure and Hamiltonian symmetries affect the discussion of synchronization blockade. Using counting principles, we prove a general theorem that synchronization blockade cannot be observed in an $N-$level system when the coherent state used to define the diagonal limit-cycle state is in the full $SU(N)$ group. We present several illustrative examples of synchronization blockade in multi-level systems and prove that information-theoretic measures of synchronization can also observe synchronization blockade-like behavior by an appropriate choice of the set of limit cycle states.

quant-ph↗
arXiv2022

Measurement Induced Continuous Time Crystals

Strong measurements usually restrict the dynamics of measured finite dimensional systems to the Zeno subspace, where subsequent evolution is unitary due to the suppression of dissipative terms. Here we show qualitatively different behaviour due to the competition between strong measurements and the thermodynamic limit, inducing a time-translation symmetry breaking phase transition resulting in a continuous time crystal. We consider a spin star model, where the central spin is subject to a strong continuous measurement, and qualify the dynamic behaviour of the system in various parameter regimes. We show that above a critical value of measurement strength, the magnetization of the thermodynamically large ancilla spins develops limit cycle oscillations. Our result also demonstrates that a coherent drive is not necessary in order to induce continuous time-translation symmetry breaking.

quant-ph↗
arXiv2022

Amplitude Amplification for Optimization via Subdivided Phase Oracle

We propose an algorithm using a modified variant of amplitude amplification to solve combinatorial optimization problems via the use of a subdivided phase oracle. Instead of dividing input states into two groups and shifting the phase equally for all states within the same group, the subdivided phase oracle changes the phase of each input state uniquely in proportion to their objective value. We provide visualization of how amplitudes change after each iteration of applying the subdivided phase oracle followed by conventional Grover diffusion in the complex plane. We then show via numerical simulation that for normal, skew normal, and exponential distribution of objective values, the algorithm can be used to amplify the probability of measuring the optimal solution to a significant degree independent of the search space size. In the case of skew normal and exponential distributions, this probability can be amplified to be close to unity, making our algorithm near deterministic. We then modify our algorithm in order to demonstrate how it can be extended to a broader set of objective value distributions. Finally, we discuss the speedup compared to classical schemes using the query complexity model, and show that our algorithm offers a significant advantage over these classical approaches.

quant-ph↗
arXiv2022

Seeding crystallization in time

We introduce the concept of seeding of crystallization in time by studying the dynamics of an ensemble of coupled continuous time crystals. We demonstrate that a single subsystem in a broken-symmetry phase acting as a nucleation center may induce time-translation symmetry breaking across the entire ensemble. Seeding is observed for both coherent as well as dissipative coupling, and for a broad range of parameter regimes. In the spirit of mutual synchronization, we investigate the parameter regime where all subsystems are in the broken symmetry phase. We observe that more broadly detuned time crystals require weaker coupling strength to be synchronized. This is in contrast to basic knowledge from classical as well as quantum synchronization theory. We show that this surprising observation is a direct consequence of the seeding effect.

quant-ph↗
arXiv2021

A Quantum Internet Architecture

Entangled quantum communication is advancing rapidly, with laboratory and metropolitan testbeds under development, but to date there is no unifying Quantum Internet architecture. We propose a Quantum Internet architecture centered around the Quantum Recursive Network Architecture (QRNA), using RuleSet-based connections established using a two-pass connection setup. Scalability and internetworking (for both technological and administrative boundaries) are achieved using recursion in naming and connection control. In the near term, this architecture will support end-to-end, two-party entanglement on minimal hardware, and it will extend smoothly to multi-party entanglement and the use of quantum error correction on advanced hardware in the future. For a network internal gateway protocol, we recommend (but do not require) qDijkstra with seconds per Bell pair as link cost for routing; the external gateway protocol is designed to build recursively. The strength of our architecture is shown by assessing extensibility and demonstrating how robust protocol operation can be confirmed using the RuleSet paradigm.

quant-ph↗
arXiv2021

QuISP: a Quantum Internet Simulation Package

We present an event-driven simulation package called QuISP for large-scale quantum networks built on top of the OMNeT++ discrete event simulation framework. Although the behavior of quantum networking devices have been revealed by recent research, it is still an open question how they will work in networks of a practical size. QuISP is designed to simulate large-scale quantum networks to investigate their behavior under realistic, noisy and heterogeneous configurations. The protocol architecture we propose enables studies of different choices for error management and other key decisions. Our confidence in the simulator is supported by comparing its output to analytic results for a small network. A key reason for simulation is to look for emergent behavior when large numbers of individually characterized devices are combined. QuISP can handle thousands of qubits in dozens of nodes on a laptop computer, preparing for full Quantum Internet simulation. This simulator promotes the development of protocols for larger and more complex quantum networks.

quant-ph↗
arXiv2021

Attacking the Quantum Internet

The main service provided by the coming Quantum Internet will be creating entanglement between any two quantum nodes. We discuss and classify attacks on quantum repeaters, which will serve roles similar to those of classical Internet routers. We have modeled the components for and structure of quantum repeater network nodes. With this model, we point out attack vectors, then analyze attacks in terms of confidentiality, integrity and availability. While we are reassured about the promises of quantum networks from the confidentiality point of view, integrity and availability present new vulnerabilities not present in classical networks and require care to handle properly. We observe that the requirements on the classical computing/networking elements affect the systems' overall security risks. This component-based analysis establishes a framework for further investigation of network-wide vulnerabilities.

quant-ph↗
arXiv2021

Role of Coherence and Degeneracies in Quantum Synchronisation

Progress on the study of synchronisation in quantum systems has been largely driven by specific examples which resulted in several examples of frequency entrainment as well as mutual synchronisation. Here we study quantum synchronisation by utilising Liouville space perturbation theory. We begin by clarifying the role of centers, symmetries and oscillating coherences in the context of quantum synchronisation. We then analyse the eigenspectrum of the Liouville superoperator generating the dynamics of the quantum system and determine the conditions under which synchronisation arises. We apply our framework to derive a powerful relationship between energy conservation, degeneracies and synchronisation in quantum systems. Finally, we demonstrate our approach by analysing two mutually coupled thermal machines and the close relationship between synchronisation and thermodynamic quantities.

quant-ph↗
arXiv2020

Generalized Measure of Quantum synchronization

We present a generalized information-theoretic measure of synchronization in quantum systems. This measure is applicable to dynamics of anharmonic oscillators, few-level atoms, and coupled oscillator networks. Furthermore, the new measure allows us to discuss synchronization of disparate physical systems such as coupled hybrid quantum systems and coupled systems undergoing mutual synchronization that are also driven locally. In many cases of interest, we find a closed-form expression for the proposed measure.

quant-ph↗
arXiv2019

Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices

Quantum network coding has been proposed to improve resource utilization to support distributed computation but has not yet been put in to practice. We investigate a particular implementation of quantum network coding using measurement-based quantum computation on IBM Q processors. We compare the performance of quantum network coding with entanglement swapping and entanglement distribution via linear cluster states. These protocols outperform quantum network coding in terms of the final Bell pair fidelities but are unsuitable for optimal resource utilization in complex networks with contention present. We demonstrate the suitability of noisy intermediate-scale quantum (NISQ) devices such as IBM Q for the study of quantum networks. We also identify the factors that limit the performance of quantum network coding on these processors and provide estimates or error rates required to boost the final Bell pair fidelities to a point where they can be used for generation of genuinely random cryptographic keys among other useful tasks. Surprisingly, the required error rates are only around a factor of 2 smaller than the current status and we expect they will be achieved in the near future.

quant-ph↗
arXiv2019

Quantum Synchronisation in Nanoscale Heat Engines

Owing to the ubiquity of synchronization in the classical world, it is interesting to study its behavior in quantum systems. Though quantum synchronisation has been investigated in many systems, a clear connection to quantum technology applications is lacking. We bridge this gap and show that nanoscale heat engines are a natural platform to study quantum synchronization and always possess a stable limit cycle. Furthermore, we demonstrate an intimate relationship between the power of a heat engine and its phase-locking properties by proving that synchronization places an upper bound on the achievable steady-state power of the engine. Finally, we show that the efficiency of the engine sets a point in terms of the bath temperatures where synchronization vanishes. We link the physical phenomenon of synchronization with the emerging field of quantum thermodynamics by establishing quantum synchronization as a mechanism of stable phase coherence.

quant-ph↗
arXiv2018

Squeezing Enhances Quantum Synchronization

It is desirable to observe synchronization of quantum systems in the quantum regime, defined by low number of excitations and a highly non-classical steady state of the self-sustained oscillator. Several existing proposals of observing synchronization in the quantum regime suffer from the fact that the noise statistics overwhelms synchronization in this regime. Here we resolve this issue by driving a self-sustained oscillator with a squeezing Hamiltonian instead of a harmonic drive and analyze this system in the classical and quantum regime. We demonstrate that strong entrainment is possible for small values of squeezing, and in this regime the states are non-classical. Furthermore, we show that the quality of synchronization measured by the FWHM of the power spectrum is enhanced with squeezing.

quant-ph↗
arXiv2015

Post hoc verification of quantum computation

With recent progress on experimental quantum information processing, an important question has arisen as to whether it is possible to verify arbitrary computation performed on a quantum processor. A number of protocols have been proposed to achieve this goal, however all are interactive in nature, requiring that the computation be performed in an interactive manner with back and forth communication between the verifier and one or more provers. Here we propose two methods for verifying quantum computation in a non-interactive manner based on recent progress in the understanding of the local Hamiltonian problem. Provided that the provers compute certain witnesses for the computation, this allows the result of a quantum computation to be verified after the fact, a property not seen in current verification protocols.

quant-ph↗
arXiv2015

Device-Independent Verifiable Blind Quantum Computation

As progress on experimental quantum processors continues to advance, the problem of verifying the correct operation of such devices is becoming a pressing concern. The recent discovery of protocols for verifying computation performed by entangled but non-communicating quantum processors holds the promise of certifying the correctness of arbitrary quantum computations in a fully device-independent manner. Unfortunately, all known schemes have prohibitive overhead, with resources scaling as extremely high degree polynomials in the number of gates constituting the computation. Here we present a novel approach based on a combination of verified blind quantum computation and Bell state self-testing. This approach has dramatically reduced overhead, with resources scaling as only $O(m^4\ln m)$ in the number of gates.

quant-ph↗
arXiv2015

Parallelizable adiabatic gate teleportation

We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of $L$ unitary gates increases at most as $O(L^5)$. However, we show that it has the interesting property that it can map the temporal order of gates to the spatial order of interactions specified by the final Hamiltonian. Using this property, we present a controlled-PAGT scheme to manipulate the order of gates by a control-qubit. In the controlled-PAGT scheme, two differently ordered sequential unitary gates $FG$ and $GF$ are coherently performed depending on the state of a control-qubit by simultaneously applying the twisted Heisenberg-type interaction Hamiltonians implementing unitary gates $F$ and $G$. We investigate why the twisted Heisenberg-type interaction Hamiltonian allows PAGT. We show that the twisted Heisenberg-type interaction Hamiltonian has an ability to perform a transposed unitary gate by just modifying the space ordering of the final Hamiltonian implementing a unitary gate in adiabatic gate teleportation. The dynamics generated by the time-reversed Hamiltonian represented by the transposed unitary gate enables deterministic simulation of a postselected event of parallelized gate teleportation in adiabatic implementation.

quant-ph↗
arXiv2014

An analysis of the trade-off between spatial and temporal resources for measurement-based quantum computation

In measurement-based quantum computation (MBQC), elementary quantum operations can be more parallelized than the quantum circuit model by employing a larger Hilbert space of graph states used as the resource. Thus MBQC can be regarded as a method of quantum computation where the temporal resource described by the depth of quantum operations can be reduced compared to the quantum circuit model by using the extra spatial resource described by graph states. To analyze the trade-off relationship of the spatial and temporal resources, we consider a method to obtain quantum circuit decompositions of general unitary transformations represented by MBQC on graph states with a certain underlying geometry called generalized flow. We present a method to translate any MBQC with generalized flow into quantum circuits without extra spatial resource. We also show an explicit way to unravel acausal gates that appear in the quantum circuit decomposition derived by a translation method presented in [V. Danos and E. Kashefi, Phys. Rev. A {\bf 74}, 052310 (2006)] and that represent an effect of the reduction of the temporal resource in MBQC. Finally, by considering a way to deterministically simulate these acausal gates, we investigate a general framework to analyze the trade-off between the spacial and temporal resources for quantum computation.

quant-ph↗
arXiv2012

Direct evaluation of pure graph state entanglement

We address the question of quantifying entanglement in pure graph states. Evaluation of multipartite entanglement measures is extremely hard for most pure quantum states. In this paper we demonstrate how solving one problem in graph theory, namely the identification of maximum independent set, allows us to evaluate three multipartite entanglement measures for pure graph states. We construct the minimal linear decomposition into product states for a large group of pure graph states, allowing us to evaluate the Schmidt measure. Furthermore we show that computation of distance-like measures such as relative entropy of entanglement and geometric measure becomes tractable for these states by explicit construction of closest separable and closest product states respectively. We show how these separable states can be described using stabiliser formalism as well as PEPs-like construction. Finally we discuss the way in which introducing noise to the system can optimally destroy entanglement.

quant-ph↗