Related papers: Quantum Distributed Algorithms for Detection of Cl…
As the scale of quantum programs grows to match that of classical software, the nascent field of quantum software engineering must mature and tools such as debuggers will become increasingly important. However, developing a quantum debugger…
A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer. Machine learning represents an important field with broad applications where…
Exact maximum clique finders have progressed to the point where we can investigate cliques in million-node social and information networks, as well as find strongly connected components in temporal networks. We use one such finder to study…
Despite the promise that fault-tolerant quantum computers can efficiently solve classically intractable problems, it remains a major challenge to find quantum algorithms that may reach computational advantage in the present era of noisy,…
Solving the discrete logarithm problem (DLP) with quantum computers is a fundamental task with important implications. Beyond Shor's algorithm, many researchers have proposed alternative solutions in recent years. However, due to current…
A framework is presented for the design and analysis of quantum mechanical algorithms, the sqrt(N) step quantum search algorithm is an immediate consequence of this framework. It leads to several other search-type applications - several…
Constraint programming (CP) is a paradigm used to model and solve constraint satisfaction and combinatorial optimization problems. In CP, problems are modeled with constraints that describe acceptable solutions and solved with backtracking…
The experimental detection of multipartite entanglement usually requires a number of appropriately chosen local quantum measurements which are aligned with respect to a previously shared common reference frame. The latter, however, can be a…
Searching and sorting used as a subroutine in many important algorithms. Quantum algorithm can find a target item in a database faster than any classical algorithm. One can trade accuracy for speed and find a part of the database (a block)…
The Feistel scheme is an important structure in the block ciphers. The security of the Feistel scheme is related to distinguishability with a random permutation. In this paper, efficient quantum algorithms for distinguishing classical…
Quantum computers, that may become available one day, would impact many scientific fields, most notably cryptography since many asymmetric primitives are insecure against an adversary with quantum capabilities. Cryptographers are already…
This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.
Community detection has become an extremely active area of research in recent years, with researchers proposing various new metrics and algorithms to address the problem. Recently, the Weighted Community Clustering (WCC) metric was proposed…
Atomic ensembles, comprising clouds of atoms addressed by laser fields, provide an attractive system for both the storage of quantum information, and the coherent conversion of quantum information between atomic and optical degrees of…
We develop a perfectly distributable quantum-classical streaming algorithm that processes signed edges to efficiently estimate the counts of triangles of diverse signed configurations in the single pass edge stream. Our approach introduces…
Design of detection strategies for multipartite entanglement stands as a central importance on our understanding of fundamental quantum mechanics and has had substantial impact on quantum information applications. However, accurate and…
In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it. The quantum differential cryptanalysis is based on…
Quantum computing has noteworthy speedup over classical computing by taking advantage of quantum parallelism, i.e., the superposition of states. In particular, quantum search is widely used in various computationally hard problems. Grover's…
The main bottleneck for distributed quantum computing is the rate at which entanglement is produced between quantum processing units (QPUs). In this work, we prove that multiple QPUs connected through slow interconnects can outperform a…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…