Related papers: Minimal computational-space implementation of mult…
We consider quantum and private communications assisted by repeaters, from the basic scenario of a single repeater chain to the general case of an arbitrarily-complex quantum network, where systems may be routed through single or multiple…
The purpose of fingerprinting is to compare long messages with low communication complexity. Compared with its classical version, the quantum fingerprinting can realize exponential reduction in communication complexity. Recently, the…
In this study, we utilized the quantum flow (QFlow) method to perform quantum simulations of correlated systems. The QFlow approach allows for sampling large sub-spaces of the Hilbert space by solving coupled variational problems in reduced…
The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially…
The multiple assignment scheme is to assign one or more shares to single participant so that any kind of access structure can be realized by classical secret sharing schemes. We propose its quantum version including ramp secret sharing…
To construct a quantum network with many end users, it is critical to have a cost-efficient way to distribute entanglement over different network ends. We demonstrate an entanglement access network, where the expensive resource, the…
Most protocols for Quantum Information Processing consist of a series of quantum gates, which are applied sequentially. In contrast, interactions, for example between matter and fields, as well as measurements such as homodyne detection of…
The selection of random subspaces plays a role in quantum information theory analogous to the role of random strings in classical information theory. Recent applications have included protocols achieving the quantum channel capacity and…
This work explores the important role of quantum routers in communication networks and investigates the increase in efficiency using memories and multiplexing strategies. Motivated by the bipartite setup introduced by Abruzzo et al. (2013)…
We describe an asynchronous algorithm to solve secure multiparty computation (MPC) over n players, when strictly less than a 1/8 fraction of the players are controlled by a static adversary. For any function f over a field that can be…
Quantum information masking is a protocol that hides the original quantum information from subsystems and spreads it over quantum correlation, which is available to multipartite except bipartite systems. In this work, we explicitly study…
We propose a new concept, oblivious quantum computation, which requires performing oblivious transfer with respect to the computation outcome of the quantum computation, where the secrecy of the input qubits and the program to identify the…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
As quantum computing (QC) technologies mature, their integration into established high-performance computing (HPC) infrastructures is becoming a central objective for next-generation computing systems. However, unlocking the potential of…
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
Quantum information processing rests on our ability to manipulate quantum superpositions through coherent unitary transformations. In reality the quantum information processor (a linear ion trap, or cavity qed implementation for example)…
A class of quantum protocols to teleport bipartite (entangled) states of two qubits is suggested. Our schemes require a single entangled pair shared by the two parties and the transmission of three bits of classical information, as well as…
Quantum networks are essential for advancing scalable quantum information processing. Quantum nonlocality sharing provides a crucial strategy for the resource-efficient recycling of quantum correlations, offering a promising pathway toward…
Coherent superposition is a key feature of quantum mechanics that underlies the advantage of quantum technologies over their classical counterparts. Recently, coherence has been recast as a resource theory in an attempt to identify and…
This paper proposes a brain-inspired approach to quantum machine learning with the goal of circumventing many of the complications of other approaches. The fact that quantum processes are unitary presents both opportunities and challenges.…