☆ 4.2 Article

Variational quantum optimization with multibasis encodings

PHYSICAL REVIEW RESEARCH (2022)

Related references

Note: Only part of the references are listed.

Article Quantum Science & Technology

Filtering variational quantum algorithms for combinatorial optimization

David Amaro et al.

Summary: This article introduces a method that utilizes filtering operators to enhance combinatorial optimization efficiency, and explores the application of causal cones to reduce the number of qubits required. Through numerical analysis and experimental validation, the method outperforms traditional algorithms in the context of maximum weighted graph cut problems.

QUANTUM SCIENCE AND TECHNOLOGY (2022)

Add to Collection

Article Physics, Multidisciplinary

Bounds on approximating Max kXOR with quantum and classical local algorithms

Kunal Marwaha et al.

Quantum (2022)

Add to Collection

Article Quantum Science & Technology

Doubling the Size of Quantum Simulators by Entanglement Forging

Andrew Eddins et al.

Summary: This article presents a method called classical entanglement forging that uses classical resources to increase the size of systems that can be simulated on quantum hardware. By utilizing classical postprocessing, the researchers were able to simulate ten spin orbitals of the water molecule on five qubits of an IBM Quantum processor, achieving the most accurate variational simulation of the H2O ground-state energy using quantum hardware to date. The authors discuss the conditions for the applicability of classical entanglement forging and propose a roadmap for scaling up to larger problems.

PRX QUANTUM (2022)

Add to Collection

Article Quantum Science & Technology

Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus

Zoe Holmes et al.

Summary: Parametrized quantum circuits are a flexible paradigm for solving variational problems and programming near-term quantum computers. By extending the barren plateau phenomenon to arbitrary ansatze, we establish a fundamental relationship between expressibility and trainability, showing that highly expressive ansatze are more difficult to train.

PRX QUANTUM (2022)

Add to Collection

Article Physics, Multidisciplinary

Quantum approximate optimization of non-planar graph problems on a planar superconducting processor

Matthew P. Harrigan et al.

Summary: Research demonstrates the application of Google Sycamore superconducting qubit quantum processor to combinatorial optimization problems. Performance depends on problem type and circuit depth, with subpar results for non-native problems, suggesting a need for more focus.

NATURE PHYSICS (2021)

Add to Collection

Review Multidisciplinary Sciences

Materials challenges and opportunities for quantum computing hardware

Nathalie P. de Leon et al.

Summary: Advances in quantum computing hardware technologies over the past two decades have been aimed at solving problems that classical computers cannot handle. Key materials challenges have been identified as limiting progress in quantum computing hardware platforms, requiring interdisciplinary collaboration beyond current boundaries.

SCIENCE (2021)

Add to Collection

Article Multidisciplinary Sciences

Cost function dependent barren plateaus in shallow parametrized quantum circuits

M. Cerezo et al.

Summary: In this study, the authors rigorously prove that defining cost functions with local observables can avoid the barren plateau problem, while defining them with global observables leads to exponentially vanishing gradients. The results indicate a connection between locality and trainability in variational quantum algorithms (VQAs).

NATURE COMMUNICATIONS (2021)

Add to Collection

Article Quantum Science & Technology

Local classical MAX-CUT algorithm outperforms p = 2 QAOA on high-girth regular graphs

Kunal Marwaha

Summary: QAOA(2) performs better than QAOA(1) on D-regular graphs of girth > 5, but there exists a classical algorithm that outperforms QAOA(2) on all graphs.

QUANTUM (2021)

Add to Collection

Article Physics, Multidisciplinary

Measurement-Based Variational Quantum Eigensolver

R. R. Ferguson et al.

Summary: This approach utilizes measurement-based quantum computation principles, involving entangled resource states and local measurements, and presents two measurement-based VQE schemes, introducing a new method for constructing variational families and translating circuit-based schemes. Both schemes offer specific advantages in terms of required resources and coherence times.

PHYSICAL REVIEW LETTERS (2021)

Add to Collection

Article Optics

Progress toward favorable landscapes in quantum combinatorial optimization

Juneseo Lee et al.

Summary: The study explores the interrelation between quantum and classical components in variational quantum algorithms, particularly focusing on their impact on solving combinatorial optimization problems. It identifies multiqubit operations as a key resource and proves that overparameterization can yield favorable landscapes in certain quantum circuit ansatze. The research also shows the importance of noncommutativity and entanglement in improving algorithm performance through numerical experiments.

PHYSICAL REVIEW A (2021)

Add to Collection

Review Physics, Applied

Variational quantum algorithms

M. Cerezo et al.

Summary: Variational quantum algorithms, utilizing classical optimizers to train parameterized quantum circuits, have emerged as a leading strategy to address the limitations of quantum computing. Despite challenges, they appear to be the best hope for achieving quantum advantage.

NATURE REVIEWS PHYSICS (2021)

Add to Collection

Article Physics, Multidisciplinary

Entanglement devised barren plateau mitigation

Taylor L. Patti et al.

Summary: This study reveals the role of entanglement in barren plateaus, proposes techniques to ameliorate them, and emphasizes the impact of entanglement on training and the avoidability of barren plateaus in the learning process.

PHYSICAL REVIEW RESEARCH (2021)

Add to Collection

Article Physics, Multidisciplinary

Entanglement clustering for ground-stateable quantum many-body states

Michael Matty et al.

Summary: The ground states of many-body local quantum Hamiltonians are of measure zero in the many-body Hilbert space, making it challenging to determine if a given quantum state is ground-stateable. This study introduces an unsupervised machine learning approach called Entanglement Clustering (EntanCl) to separate ground-stateable wave functions from excited-state wave functions based on entanglement structure information. By projecting high-dimensional data to two dimensions and clustering using K-means clustering with k = 2, EntanCl can efficiently distinguish ground states from excited states.

PHYSICAL REVIEW RESEARCH (2021)

Add to Collection

Article Optics

MaxCut quantum approximate optimization algorithm performance guarantees for p > 1

Jonathan Wurtz et al.

Summary: This research provides worst-case performance guarantees for p = 2 and 3 QAOA on uniform 3-regular graphs for the MaxCut problem. Lower bounds for approximation ratios are determined, and a conjecture for a hierarchy of worst-case graphs based on cycle constraints is proposed. An upper bound on worst-case approximation ratios is also identified, suggesting limitations for quantum advantage in certain graph classes.

PHYSICAL REVIEW A (2021)

Add to Collection

Article Physics, Multidisciplinary

Information Scrambling in Quantum Neural Networks

Huitao Shen et al.

PHYSICAL REVIEW LETTERS (2020)

Add to Collection

Article Computer Science, Information Systems

Parameterized algorithms of fundamental NP-hard problems: a survey

Wenjun Li et al.

HUMAN-CENTRIC COMPUTING AND INFORMATION SCIENCES (2020)

Add to Collection

Article Physics, Multidisciplinary

Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices

Leo Zhou et al.

PHYSICAL REVIEW X (2020)

Add to Collection

Article Multidisciplinary Sciences

Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator

Guido Pagano et al.

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2020)

Add to Collection

Article Physics, Multidisciplinary

Obstacles to Variational Quantum Optimization from Symmetry Protection

Sergey Bravyi et al.

PHYSICAL REVIEW LETTERS (2020)

Add to Collection

Article Physics, Multidisciplinary

What Limits the Simulation of Quantum Computers?

Yiqing Zhou et al.

PHYSICAL REVIEW X (2020)

Add to Collection

Article Quantum Science & Technology

Exploring Entanglement and Optimization within the Hamiltonian Variational Ansatz

Roeland Wiersema et al.

PRX QUANTUM (2020)

Add to Collection

Article Optics

XY mixers: Analytical and numerical results for the quantum alternating operator ansatz

Zhihui Wang et al.

PHYSICAL REVIEW A (2020)

Add to Collection

Article Multidisciplinary Sciences

Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems

Hayato Goto et al.

SCIENCE ADVANCES (2019)

Add to Collection

Article Multidisciplinary Sciences

QAOA for Max-Cut requires hundreds of qubits for quantum speed-up

G. G. Guerreschi et al.

SCIENTIFIC REPORTS (2019)

Add to Collection

Article Computer Science, Artificial Intelligence

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

Stuart Hadfield et al.

ALGORITHMS (2019)

Add to Collection

Article Quantum Science & Technology

Towards quantum machine learning with tensor networks

William Huggins et al.

QUANTUM SCIENCE AND TECHNOLOGY (2019)

Add to Collection

Article Multidisciplinary Sciences

qTorch: The quantum tensor contraction handler

E. Schuyler Fried et al.

PLOS ONE (2018)

Add to Collection

Article Multidisciplinary Sciences

Barren plateaus in quantum neural network training landscapes

Jarrod R. McClean et al.

NATURE COMMUNICATIONS (2018)

Add to Collection

Article Quantum Science & Technology

Quantum Computing in the NISQ era and beyond

John Preskill

QUANTUM (2018)

Add to Collection

Review Physics, Multidisciplinary

Hand-waving and interpretive dance: an introductory course on tensor networks

Jacob C. Bridgeman et al.

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL (2017)

Add to Collection

Article Multidisciplinary Sciences

Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets

Abhinav Kandala et al.

NATURE (2017)

Add to Collection

Article Computer Science, Artificial Intelligence

Non-convex Optimization for Machine Learning

Prateek Jain et al.

FOUNDATIONS AND TRENDS IN MACHINE LEARNING (2017)

Add to Collection

Article Physics, Multidisciplinary

The theory of variational hybrid quantum-classical algorithms

Jarrod R. McClean et al.

NEW JOURNAL OF PHYSICS (2016)

Add to Collection

Article Optics

Progress towards practical quantum variational algorithms

Dave Wecker et al.

PHYSICAL REVIEW A (2015)

Add to Collection

Article Physics, Multidisciplinary

A practical introduction to tensor networks: Matrix product states and projected entangled pair states

Roman Orus

ANNALS OF PHYSICS (2014)

Add to Collection

Article Multidisciplinary Sciences

A variational eigenvalue solver on a photonic quantum processor

Alberto Peruzzo et al.

NATURE COMMUNICATIONS (2014)

Add to Collection

Article Physics, Multidisciplinary

Ising formulations of many NP problems

Andrew Lucas

FRONTIERS IN PHYSICS (2014)

Add to Collection

Article

Entanglement of formation and concurrence for mixed states

Xiuhong Gao et al.

Frontiers of Computer Science in China (2008)

Add to Collection

Article Computer Science, Theory & Methods

Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

Subhash Khot et al.

SIAM JOURNAL ON COMPUTING (2007)

Add to Collection

Article Optics

Measurement-based quantum computation on cluster states

R Raussendorf et al.

PHYSICAL REVIEW A (2003)

Add to Collection

Article Computer Science, Software Engineering

Randomized heuristics for the MAX-CUT problem

P Festa et al.

OPTIMIZATION METHODS & SOFTWARE (2002)

Add to Collection

Article Computer Science, Hardware & Architecture

Some optimal inapproximability results

J Håstad

JOURNAL OF THE ACM (2001)

Add to Collection

Article Physics, Multidisciplinary

A one-way quantum computer

R Raussendorf et al.

PHYSICAL REVIEW LETTERS (2001)

Add to Collection

Article Mathematics, Applied

Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs

S Burer et al.

SIAM JOURNAL ON OPTIMIZATION (2001)

Add to Collection

© Peeref 2019-2024. All rights reserved.