Related papers: Sequential quantum cloning under real-life conditi…
Classical simulators play a major role in the development and benchmark of quantum algorithms and practically any software framework for quantum computation provides the option of running the algorithms on simulators. However, the…
Quantum chemistry calculations for small molecules on quantum hardware have been demonstrated to date only on universal-gate quantum computers, not quantum annealers. The latter devices are limited to finding the lowest eigenstate of the…
Here, asymmetric phase-covariant quantum cloning machines are defined and trade-off between qualities of their outputs and its impact on entanglement properties of the outputs are studies. In addition, optimal families among these cloners…
Full-scale quantum computers require the integration of millions of quantum bits. The promise of leveraging industrial semiconductor manufacturing to meet this requirement has fueled the pursuit of quantum computing in silicon quantum dots.…
Precise control of quantum systems is of fundamental importance for quantum device engineering, such as is needed in the fields of quantum information processing, high-resolution spectroscopy and quantum metrology. When scaling up the…
Parallelism of tight-binding molecular dynamics simulations is presented by means of the order-N electronic structure theory with the Wannier states, recently developed (J. Phys. Soc. Jpn. 69,3773 (2000)). An application is tested for…
We demonstrate the possibility of controlling the success probability of a secret sharing protocol using a quantum cloning circuit. The cloning circuit is used to clone the qubits containing the encoded information and {\em en route} to the…
We propose a general scheme for dissipatively preparing arbitrary pure quantum states on a multipartite qubit register in a finite number of basic control blocks. Our "splitting-subspace" approach relies on control resources that are…
Quantum-selected configuration interaction (QSCI) has emerged as a feasible approach for approximating electronic ground states on noisy quantum devices toward large-system demonstrations. In QSCI, Slater determinants are sampled from a…
Simulations of quantum chemistry and quantum materials are believed to be among the most important potential applications of quantum information processors, but realizing practical quantum advantage for such problems is challenging. Here,…
Quantum simulation is a promising pathway toward practical quantum advantage by simulating large-scale quantum systems. In this work, we propose communication-efficient distributed quantum simulation protocols by exploring three quantum…
The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix arithmetics -- with the result encoded in the off-diagonal blocks of a…
Practical quantum state tomography is usually performed by carrying out repeated measurements on many copies of a given state. The accuracy of the reconstruction depends strongly on the dimensionality of the system and the number of copies…
Gradient descent method, as one of the major methods in numerical optimization, is the key ingredient in many machine learning algorithms. As one of the most fundamental way to solve the optimization problems, it promises the function value…
We consider to treat the usual probabilistic cloning, state separation, unambiguous state discrimination, \emph{etc} in a uniform framework. All these transformations can be regarded as special examples of generalized completely positive…
Quantum information can not be perfectly cloned, but approximate copies of quantum information can be generated. Quantum telecloning combines approximate quantum cloning, more typically referred as quantum cloning, and quantum…
As a cornerstone for many quantum linear algebraic and quantum machine learning algorithms, controlled quantum state preparation (CQSP) aims to provide the transformation of $|i\rangle |0^n\rangle \to |i\rangle |\psi_i\rangle $ for all…
We study machines that take N identical replicas of a pure qudit state as input and output a set of M_A clones of a given fidelity and another set of $M_B$ clones of another fidelity. The trade-off between these two fidelities is…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
The performance of quantum algorithms for ground-state energy estimation is directly impacted by the quality of the initial state, where quality is traditionally defined in terms of the overlap of the input state with the target state. An…