Papers
Live trends in quantum computing research, updated daily from arXiv.
Total Papers
31,714
This Month
152
Today
0
Research Volume
15,758 papers in 12 months (-37% vs prior quarter)
Research Focus Areas
Papers by research theme (12 months). Hover for details.
Qubit Platforms
Hardware platform mentions in abstracts — Photonic leads
Faster Digital Quantum Simulation by Symmetry Protection
Minh C. Tran, Yuan Su, D. Carney +1 more·Jun 29, 2020
Simulating the dynamics of quantum systems is an important application of quantum computers and has seen a variety of implementations on current hardware. We show that by introducing quantum gates implementing unitary transformations generated by the...
Amplitude estimation via maximum likelihood on noisy quantum computer
Tomoki Tanaka, Yohichi Suzuki, Shumpei Uno +3 more·Jun 29, 2020
Recently we find several candidates of quantum algorithms that may be implementable in near-term devices for estimating the amplitude of a given quantum state, which is a core subroutine in various computing tasks such as the Monte Carlo methods. One...
The impacts of optimization algorithm and basis size on the accuracy and efficiency of variational quantum eigensolver based on unitary coupled cluster ansatz
Xian-Hu Zha, Chao Zhang, Deng-Ping Fan +3 more·Jun 29, 2020
Variational quantum eigensolver (VQE) is demonstrated to be the promising methodology for quantum chemistry based on near-term quantum devices. However, many problems are yet to be investigated for this methodology, such as the influences of optimiza...
Quantum simulation of the qubit-regularized O(3)-sigma model
Alex Buser, T. Bhattacharya, L. Cincio +1 more·Jun 28, 2020
Recently, Singh and Chandrasekharan showed that fixed points of the non-linear $O(3)$ sigma model can be reproduced near a quantum phase transition of a spin model with just two qubits per lattice site. In this paper, we demonstrate how to prepare th...
QPSO-CD: quantum-behaved particle swarm optimization algorithm with Cauchy distribution
A. Bhatia, M. Saggi, Shenggen Zheng·Jun 27, 2020
Motivated by the particle swarm optimization (PSO) and quantum computing theory, we have presented a quantum variant of PSO (QPSO) mutated with Cauchy operator and natural selection mechanism (QPSO-CD) from evolutionary computations. The performance ...
Efficient step-merged quantum imaginary time evolution algorithm for quantum chemistry.
N. Gomes, Feng Zhang, Noah F. Berthusen +4 more·Jun 27, 2020
We develop a resource efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along the state e...
Optimizing adiabatic quantum pathways via a learning algorithm
Xiaodong Yang, Ran Liu, Jun Li +1 more·Jun 27, 2020
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand us to accel...
Quantum Approximate Optimization for Hard Problems in Linear Algebra
Ajinkya Borle, V. Elfving, S. Lomonaco·Jun 27, 2020
The quantum approximate optimization algorithm (QAOA) by Farhi et al. is a quantum computational framework for solving quantum or classical optimization tasks. Here, we explore using QAOA for binary linear least squares (BLLS); a problem that can ser...
Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Pjotr Buys, Andreas Galanis, V. Patel +1 more·Jun 26, 2020
Abstract We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter $\lambda $ on the unit circle in the complex plane. Complex-valued parameters for the Ising mode...
Truncated moment sequences and a solution to the channel separability problem
N. Milazzo, D. Braun, O. Giraud·Jun 26, 2020
We consider the problem of separability of quantum channels via the Choi matrix representation given by the Choi-Jamiolkowski isomorphism. We explore three classes of separability across different cuts between systems and ancillae and we provide a so...
Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method
U. Chukwu, Raouf Dridi, Jesse Berwald +5 more·Jun 26, 2020
Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the problem via two different quantum-ready methods to understand the stre...
Efficient 2D Tensor Network Simulation of Quantum Systems
Yuchen Pang, Tianyi Hao, Annika Dugad +2 more·Jun 26, 2020
Simulation of quantum systems is challenging due to the exponential size of the state space. Tensor networks provide a systematically improvable approximation for quantum states. 2D tensor networks such as Projected Entangled Pair States (PEPS) are w...
A co-design framework of neural networks and quantum circuits towards quantum advantage
Weiwen Jiang, Jinjun Xiong, Yiyu Shi·Jun 26, 2020
Despite the pursuit of quantum advantages in various applications, the power of quantum computers in executing neural network has mostly remained unknown, primarily due to a missing tool that effectively designs a neural network suitable for quantum ...
Quantum Computing for Finance: State-of-the-Art and Future Prospects
D. Egger, Claudio Gambella, Jakub Marecek +6 more·Jun 25, 2020
This article outlines our point of view regarding the applicability, state-of-the-art, and potential of quantum computing for problems in finance. We provide an introduction to quantum computing as well as a survey on problem classes in finance that ...
Quantum Amplitude Estimation in the Presence of Noise
Eric G. Brown, O. Goktas, W. Tham·Jun 25, 2020
Quantum Amplitude Estimation (QAE) -- a technique by which the amplitude of a given quantum state can be estimated with quadratically fewer queries than by standard sampling -- is a key sub-routine in several important quantum algorithms, including G...
Un-Weyl-ing the Clifford Hierarchy
Tefjol Pllaha, Narayanan Rengaswamy, O. Tirkkonen +1 more·Jun 24, 2020
The teleportation model of quantum computation introduced by Gottesman and Chuang (1999) motivated the development of the Clifford hierarchy. Despite its intrinsic value for quantum computing, the widespread use of magic state distillation, which is ...
Deep learning enhanced individual nuclear-spin detection
Kyunghoon Jung, M. Abobeih, Jiwon Yun +5 more·Jun 24, 2020
The detection of nuclear spins using individual electron spins has enabled diverse opportunities in quantum sensing and quantum information processing. Proof-of-principle experiments have demonstrated atomic-scale imaging of nuclear-spin samples and ...
Quantum Information Processing: An Essential Primer
E. Soljanin·Jun 24, 2020
Quantum information science is an exciting, wide, rapidly progressing, cross-disciplinary field, and that very nature makes it both attractive and hard to enter. In this primer, we first provide answers to the three essential questions that any newco...
Bell inequality violation on small NISQ computers
H. Naus, H. Technology, Netherlands Institute for Space Research +2 more·Jun 24, 2020
Quantum computational experiments exploiting Noisy Intermediate-Scale Quantum (NISQ) devices to demonstrate violation of a Bell inequality are proposed. They consist of running specified quantum algorithms on few-qubit computers. If such a device ass...
Two quantum Ising algorithms for the shortest-vector problem
David Joseph, A. Callison, Cong Ling +1 more·Jun 24, 2020
Traditional public key cryptography will become obsolete when quantum computers are able to break it. The authors propose two quantum algorithms to solve the shortest-vector problem, which could play an important role in designing new cryptosystems f...