Related papers: A universal whitening algorithm for commercial ran…
We present a new algorithm for reducing an arbitrary unitary matrix U into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of…
We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble in an explicit and controlled way,…
Topological quantum error correction codes have high thresholds and are well suited to physical implementation. The minimum weight perfect matching algorithm can be used to efficiently handle errors in such codes. We perform a timing…
Current prevailing designs of quantum random number generators (QRNGs) designs typically employ post-processing techniques to distill raw random data, followed by statistical verification with suites like NIST SP 800-22. This paper…
Quantum computers promise to outperform their classical counterparts at certain tasks. However, existing quantum devices are error-prone and restricted in size. Thus, effective compilation methods are crucial to exploit limited quantum…
We propose and investigate a method to optimize recurrence entanglement purification protocols. The approach is based on a numerical search in the whole set of SU(4) matrices with the aid of a quasi-Newton algorithm. Our method evaluates…
Probabilistic error cancellation is a quantum error mitigation technique capable of producing unbiased computation results but requires an accurate error model. Constructing this model involves estimating a set of parameters, which, in the…
Global unitary transformations (OPTSWAPS) that optimally increase the bias of any mixed computation qubit in a quantum system -- represented by a diagonal density matrix -- towards a particular state of the computational basis which, in…
A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into…
This work presents some novel techniques to enhance an encryption scheme motivated by classical McEliece cryptosystem. Contributions include: (1) using masking matrices to hide sensitive data, (2) allowing both legitimate parties to…
It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation,…
Information-efficient approaches for extracting randomness from imperfect sources have been extensively studied, but simpler and faster ones are required in the high-speed applications of random number generation. In this paper, we focus on…
We improve on the results of [A. Jackson et al. Proc. Natl. Acad. Sci. U.S.A 121 (6). 2024] on the verification of analogue quantum simulators by eliminating the use of universal Hamiltonians, removing the need for two-qubit gates, and no…
An efficient technique of computing on encrypted data allows a client with limited capability to perform complex operations on a remote fault-tolerant server without leaking anything about the input or output. Quantum computing provides…
Quantum process tomography is a necessary tool for verifying quantum gates and diagnosing faults in architectures and gate design. We show that the standard approach of process tomography is grossly inaccurate in the case where the states…
Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy…
We present a high-quality, bias-free quantum random number generator (QRNG) using photon arrival time selectively in accordance with the number of photon detection events within a sampling time interval in attenuated light. It is well…
Characterizing and mitigating errors in current noisy intermediate-scale devices is important to improve performance of next generations of quantum hardware. In order to investigate the importance of the different noise mechanisms affecting…
High quality, fully-programmable quantum processors are available with small numbers (<1000) of qubits, and the scientific potential of these near term machines is not well understood. If the small number of physical qubits precludes…
We propose a probabilistic quantum algorithm that decides whether a monochrome picture matches a given template (or one out of a set of templates). As a major advantage to classical pattern recognition, the algorithm just requires a few…