Related papers: Numerical Analysis of Boosting Scheme for Scalable…
Currently available noisy intermediate-scale quantum (NISQ) devices are limited by the number of qubits that can be used for quantum chemistry calculations on molecules. We show herein that the number of qubits required for simulations on a…
Cooling the qubit into a pure initial state is crucial for realizing fault-tolerant quantum information processing. Here we envisage a star-topology arrangement of reset and computation qubits for this purpose. The reset qubits cool or…
To run an algorithm on a quantum computer, one must choose an assignment from logical qubits in a circuit to physical qubits on quantum hardware. This task of initial qubit placement, or qubit allocation, is especially important on…
Simulating electronic structure on a quantum computer requires encoding of fermionic systems onto qubits. Common encoding methods transform a fermionic system of $N$ spin-orbitals into an $N$-qubit system, but many of the fermionic…
Due to the immense potential of quantum computers and the significant computing overhead required in machine learning applications, the variational quantum classifier (VQC) has received a lot of interest recently for image classification.…
Quantum variational algorithms (QVAs) are increasingly potent tools for simulating quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. This work examines the application of the Variational Quantum Eigensolver (VQE)…
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not…
Approximate combinatorial optimization is a promising use case for quantum computers. The quantum optimization algorithms often employ a fixed ansatz that evolves an unbiased initial state towards states with better values of the optimand,…
Accurately predicting response properties of molecules such as the dynamic polarizability and hyperpolarizability using quantum mechanics has been a long-standing challenge with widespread applications in material and drug design. Classical…
The computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian, a property that manifests in the necessary rescaling of its eigenvalues. The typical approach of using the 1-norm…
A scheme for decoupling and selectively recoupling large networks of dipolar-coupled spins is proposed. The scheme relies on a combination of broadband, decoupling pulse sequences applied to all the nuclear spins with a band-selective pulse…
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…
The von Neumann entropy of various quantum dissipative models is calculated in order to discuss the entanglement properties of these systems. First, integrable quantum dissipative models are discussed, i.e., the quantum Brownian motion and…
The most scalable proposed methods of simulating lattice fermions on noisy quantum computers employ encodings that eliminate nonlocal operators using a constant factor more qubits and a nontrivial stabilizer group. In this work, we…
In this note we point out the fact that the proper conceptual setting of quantum computation is the theory of Linear Time Invariant systems. To convince readers of the utility of the approach, we introduce a new model of computation based…
In this study, we examine decoherence of qubits system coupled independently by using influence functional. We especially concentrated on the effect of qubit flip process. We examine the zero-dimensional qubit and one-dimensional qubits…
It is von Neumann who opened the window for today's Information epoch. He defined quantum entropy including Shannon's information more than 20 years ahead of Shannon, and he introduced a concept what computation means mathematically. In…
Algorithmic Cooling is a method that uses novel data compression techniques and simplecquantum computing devices to improve NMR spectroscopy, and to offer scalable NMR quantum computers. The algorithm recursively employs two steps. A…
A significant problem for current quantum computers is noise. While there are many distinct noise channels, the depolarizing noise model often appropriately describes average noise for large circuits involving many qubits and gates. We…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…