Related papers: Higher-order quantum computing with known input st…
Quantum computing holds transformative potential for medical applications, yet efficiently preparing quantum states from complex medical data remains a fundamental challenge. This survey provides a comprehensive examination of current…
Black-box optimization refers to the optimization problem whose objective function and/or constraint sets are either unknown, inaccessible, or non-existent. In many applications, especially with the involvement of humans, the only way to…
We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states $\{\rho_1, \dots, \rho_k\}$ to another such set $\{\hat\rho_1, \dots, \hat\rho_k\}$. In other words, we must…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
We consider generic pure $n$-qubit states and a general class of pure states of arbitrary dimensions and arbitrarily many subsystems. We characterize those states which can be reached from some other state via Local Operations assisted by…
Programming for today's quantum computers is making significant strides toward modern workflows compatible with high performance computing (HPC), but fundamental challenges still remain in the integration of these vastly different…
Accurately estimating high-order moments of quantum states is an elementary precondition for many crucial tasks in quantum computing, such as entanglement spectroscopy, entropy estimation, spectrum estimation, and predicting non-linear…
We propose a quantum algorithm that emulates the action of an unknown unitary transformation on a given input state, using multiple copies of some unknown sample input states of the unitary and their corresponding output states. The…
Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…
The term quantum neural computing indicates a unity in the functioning of the brain. It assumes that the neural structures perform classical processing and that the virtual particles associated with the dynamical states of the structures…
A common objective for quantum control is to force a quantum system, initially in an unknown state, into a particular target subspace. We show that if the subspace is required to be a decoherence-free subspace of dimension greater than 1,…
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new…
Adiabatic quantum computation (AQC) is a universal model for quantum computation which seeks to transform the initial ground state of a quantum system into a final ground state encoding the answer to a computational problem. AQC initial…
Quantum information theory is used to analize various non-linear operations on quantum states. The universal disentanglement machine is shown to be impossible, and partial (negative) results are obtained in the state-dependent case. The…
Quantum Process Tomography (QPT) methods aim at identifying, i.e. estimating, a given quantum process. QPT is a major quantum information processing tool, since it especially allows one to characterize the actual behavior of quantum gates,…
To effectively utilize quantum incompatibility as a resource in quantum information processing, it is crucial to evaluate how incompatible a set of devices is. In this study, we propose an ordering to compare incompatibility and reveal its…
In a new branch of quantum computing, information is encoded into coherent states, the primary carriers of optical communication. To exploit it, quantum bits of these coherent states are needed, but it is notoriously hard to make…
In this paper we give a polynomial-time quantum algorithm for computing orders of solvable groups. Several other problems, such as testing membership in solvable groups, testing equality of subgroups in a given solvable group, and testing…
A set of new schemes for quantum computation and communication have been either designed or experimentally realized using optimal quantum resources. A multi-output quantum teleportation scheme, where a sender (Alice) teleports an m and…
Continuous-variable quantum computing utilizes continuous parameters of a quantum system to encode information, promising efficient solutions to complex problems. Trapped-ion systems provide a robust platform with long coherence times and…