Related papers: Timed Quorum System for Large-Scale and Dynamic En…
We critically explore the applicability of a recently proposed framework to sample the quantum dynamics of a many-body quantum system interacting with light by stochastic trajectories, applying it to the closed and open Tavis-Cummings model…
Quantum systems are exceedingly difficult to engineer because they are sensitive to various types of noises. In particular, time-dependent noises are frequently encountered in experiments but how to overcome them remains a challenging…
The paper analyzes the performance of tandem network of polling queue with setups. For a system with two-products and two-stations, we propose a new approach based on a partially-collapsible state-space characterization to reduce…
We have applied a machine learning algorithm to predict the emergence of environment-induced spontaneous synchronization between two qubits in an open system setting. In particular, we have considered three different models, encompassing…
Two novel measurement-based, quantum clustering algorithms are proposed based on quantum parallelism and entanglement. The first algorithm follows a divisive approach. The second algorithm is based on unsharp measurements, where we…
In this paper, we propose novel channel-hoppingbased distributed rendezvous algorithm based on grid-basedquorum techniques. The proposed algorithm increases the probability of rendezvous (RDV) within a single cycle by allowing CR nodes to…
A model of clustering dynamics is proposed for a population of spatially distributed active rotators. A transition from excitable to oscillatory dynamics is induced by the increase of the local density of active rotators. It is interpreted…
Sequential Quantum Secret Sharing schemes (QSS) do not use entangled states for secret sharing, rather they rely on sequential operations of the players on a single state which is circulated between the players. In order to check the…
Quantum processors are being integrated into HPC ecosystems as co-processors, where compilation of quantum circuits into hardware-executable form determines both output fidelity and runtime. Current compilers use a fixed pass sequence and…
We study for a composite quantum system with a quantum Turing architecture the temporal non-locality of quantum mechanics by using the temporal Bell inequality, which will be derived for a discretized network dynamics by identifying the…
Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs)…
In this paper, a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced. The method is parameterized in order to affect…
While the preparation of a general quantum state is challenging, realistic problem instances, such as those encountered in quantum chemistry and quantum machine learning-typically exhibit hierarchical amplitude structures, consisting of a…
We investigate the emergence of time quasicrystals (TQCs) in the open Dicke model, subjected to a quasi-periodic Fibonacci drive. TQCs are characterized by a robust sub-harmonic quasi-periodic response that is qualitatively distinct from…
Considering widely dispersed uncertain renewable energy sources (RESs), scenario-based stochastic optimization is an effective method for the economic dispatch of renewables-rich power systems. However, on classic computers, to simulate RES…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…
A dynamical decoupling method is presented which is based on embedding a deterministic decoupling scheme into a stochastic one. This way it is possible to combine the advantages of both methods and to increase the suppression of undesired…
Inspired by the advancements in large language models based on transformers, we introduce the transformer quantum state (TQS): a versatile machine learning model for quantum many-body problems. In sharp contrast to Hamiltonian/task specific…
Quantum digital signatures (QDS) exploit quantum laws to guarantee non-repudiation, unforgeability and transferability of messages with information-theoretic security. Current QDS protocols face two major restrictions, including the…
Considering the large-scale quantum computer, it is important to know how much quantum computational resources is necessary precisely and quickly. Unfortunately the previous methods so far cannot support a large-scale quantum computing…