Related papers: HighDist Framework: Algorithms and Applications
Quantum key distribution algorithms are considered secure because they leverage quantum phenomena to provide security. As such, eavesdroppers can be detected by analyzing the error rate in the shared key obtained by the parties performing…
Quantum key distribution (QKD) has emerged as a promising solution to protect current cryptographic systems against the threat of quantum computers. As QKD transitions from laboratories to real-world applications, its implementation under…
Quantum mechanical problems are among the hardest to simulate and, in some cases, remain intractable even for the most powerful computers. Quantum computing has emerged as a new technological platform to address such challenges, with rapid…
Quantum key distribution (QKD offers a long-term solution to establish information-theoretically secure keys between two distant users. In practice, with a careful characterization of quantum sources and the decoy-state method,…
Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…
Engineering the Hamiltonian of a quantum system is fundamental to the design of quantum systems. Automating Hamiltonian design through gradient-based optimization can dramatically accelerate this process. However, computing the gradients of…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…
Quantum optimization algorithms are inherently probabilistic, yet they are most often used to search for a single high-quality solution. In this paper, we instead study hypergraph partitioning problems in which the desired output is itself…
Hybrid quantum-classical optimization using near-term quantum technology is an emerging direction for exploring quantum advantage in high-dimensional systems. However, precise characterization of all experimental parameters is often…
We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore…
The Quantum Approximate Optimization Algorithm (QAOA) constitutes one of the often mentioned candidates expected to yield a quantum boost in the era of near-term quantum computing. In practice, quantum optimization will have to compete with…
A photon with a modulated wavefront can produce a quantum communication channel in a larger Hilbert space. For example, higher dimensional quantum key distribution (HD-QKD) can encode information in the transverse linear momentum (LM) or…
We present a number of results related to quantum algorithms with small error probability and quantum algorithms that are zero-error. First, we give a tight analysis of the trade-offs between the number of queries of quantum search…
With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical…
Amplitude estimation algorithms are based on Grover's algorithm: alternating reflections about the input state and the desired outcome. But what if we are given the ability to perform arbitrary rotations, instead of just reflections? In…
Multiple photonic degrees of freedom can be explored to generate high-dimensional quantum states; commonly referred to as `qudits'. Qudits offer several advantages for quantum communications, including higher information capacity, noise…
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed…
The advent of quantum computers has significantly challenged the security of traditional cryptographic systems, prompting a surge in research on quantum key distribution (QKD). Among various QKD approaches, continuous-variable QKD (CVQKD)…
A protocol with the potential of beating the existing distance records for conventional quantum key distribution (QKD) systems is proposed. It borrows ideas from quantum repeaters by using memories in the middle of the link, and that of…
Scalability is currently one of the most sought-after objectives in the field of quantum computing. Distributing a quantum circuit across a quantum network is one way to facilitate large computations using current quantum computers. In this…