Parallelizing Quantum Simulation With Decision Diagrams

Since people became aware of the power of quantum phenomena in the domain of traditional computation, a great number of complex problems that were once considered intractable in the classical world have been tackled. The downsides of quantum supremacy are its high cost and unpredictability. Numerous researchers are relying on quantum simulators running on classical […]

Parallelizing Quantum Simulation With Decision Diagrams

Since people became aware of the power of quantum phenomena in the domain of traditional computation, a great number of complex problems that were once considered intractable in the classical world have been tackled. The downsides of quantum supremacy are its high cost and unpredictability. Numerous researchers are relying on quantum simulators running on classical […]

Rateless Protograph LDPC Codes for Quantum Key Distribution

Information reconciliation (IR) is a key step in quantum key distribution (QKD). In recent years, blind reconciliation based on low-density parity-check (LDPC) codes has replaced Cascade as a standard de facto since it guarantees efficient IR without a priori quantum bit error rate estimation and with limited interactivity between the parties, which is essential in […]

Tools for the Analysis of Quantum Protocols Requiring State Generation Within a Time Window

Quantum protocols commonly require a certain number of quantum resource states to be available simultaneously. An important class of examples is quantum network protocols that require a certain number of entangled pairs. Here, we consider a setting in which a process generates a quantum resource state with some probability p in each time step and […]

Network Anomaly Detection Using Quantum Neural Networks on Noisy Quantum Computers

The escalating threat and impact of network-based attacks necessitate innovative intrusion detection systems. Machine learning has shown promise, with recent strides in quantum machine learning offering new avenues. However, the potential of quantum computing is tempered by challenges in current noisy intermediate-scale quantum era machines. In this article, we explore quantum neural networks (QNNs) for […]

State Preparation on Quantum Computers via Quantum Steering

Quantum computers present a compelling platform for the study of open quantum systems, namely, the nonunitary dynamics of a system. Here, we investigate and report digital simulations of Markovian nonunitary dynamics that converge to a unique steady state. The steady state is programmed as a desired target state, yielding semblance to a quantum state preparation […]

Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts

A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into classical postprocessing steps and a set of smaller scale quantum computations that individually require fewer qubits, lower qubit connectivity, and typically incur less error. However, as partitioning […]

Optimal Partitioning of Quantum Circuits Using Gate Cuts and Wire Cuts

A limited number of qubits, high error rates, and limited qubit connectivity are major challenges for effective near-term quantum computations. Quantum circuit partitioning divides a quantum computation into classical postprocessing steps and a set of smaller scale quantum computations that individually require fewer qubits, lower qubit connectivity, and typically incur less error. However, as partitioning […]

A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks

Quantum internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This article deals with the problem of scheduling in an arbitrary entanglement swapping quantum network—often called first-generation quantum network—in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework […]

A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks

Quantum internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This article deals with the problem of scheduling in an arbitrary entanglement swapping quantum network—often called first-generation quantum network—in its general topology, multicommodity, loss-aware formulation. We introduce a linear algebraic framework […]