Related papers: Experimental realization of quantum cheque using a…
We experimentally demonstrate in NMR a quantum interferometric multi-meter for extracting certain properties of unknown quantum states without resource to quantum tomography. It can perform direct state determinations,…
Quantum computing (QC) provides a promising avenue toward enabling quantum chemistry calculations, which are classically impossible due to a computational complexity that increases exponentially with system size. As fully fault-tolerant…
Current quantum computers have the potential to overcome classical computational methods, however, the capability of the algorithms that can be executed on noisy intermediate-scale quantum devices is limited due to hardware imperfections.…
We implement a simulation of a quantum field theory in 1+1 space-time dimensions on a gate-based quantum computer using the light front formulation of the theory. The nonperturbative simulation of the Yukawa model field theory is verified…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
Ensuring security and integrity of elections constitutes an important challenge with wide-ranging societal implications. Classically, security guarantees can be ensured based on computational complexity, which may be challenged by quantum…
We show that the quantum baker's map, a prototypical map invented for theoretical studies of quantum chaos, has a very simple realization in terms of quantum gates. Chaos in the quantum baker's map could be investigated experimentally on a…
Quantum computing tries to exploit entanglement and interference to process information more efficiently than the best known classical solutions. Experiments demonstrating the feasibility of this approach have already been performed.…
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the…
We present and analyze a quantum algorithm to estimate credit risk more efficiently than Monte Carlo simulations can do on classical computers. More precisely, we estimate the economic capital requirement, i.e. the difference between the…
The notion of compressed quantum computation is employed to simulate the Ising interaction of a 1D--chain consisting out of $n$ qubits using the universal IBM cloud quantum computer running on $\log(n)$ qubits. The external field parameter…
Quantum computers have the potential to efficiently simulate large-scale quantum systems for which classical approaches are bound to fail. Even though several existing quantum devices now feature total qubit numbers of more than one…
Implementing a qubit quantum computer in continuous-variable systems conventionally requires the engineering of specific interactions according to the encoding basis states. In this work, we present a unified formalism to conduct universal…
A scheme for distributed quantum measurement that allows nondestructive or indirect Bell measurement was proposed by Gupta et al., (Int. J. Quant. Infor. \textbf{5} (2007) 627) and subsequently realized experimentally using an NMR-based…
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger…
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 computing and quantum Monte Carlo (QMC) are respectively the state-of-the-art quantum and classical computing methods for understanding many-body quantum systems. Here, we propose a hybrid quantum-classical algorithm that integrates…
Variational quantum algorithms exploit the features of superposition and entanglement to optimize a cost function efficiently by manipulating the quantum states. They are suitable for noisy intermediate-scale quantum (NISQ) computers that…
In this letter, we proposed a quantum authentication protocol. The authentication process is implemented by the symmetric cryptographic scheme with quantum effects.
Due to its geometric nature, holonomic quantum computation is fault-tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open…