A quantum approach to the discretizable molecular distance geometry problem
From MaRDI portal
Publication:2101499
DOI10.1007/s11128-022-03583-wOpenAlexW3215217853MaRDI QIDQ2101499
Renato Portugal, Andrês Oliveira, Franklin Marquezino, Carlile C. Lavor
Publication date: 6 December 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.01303
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- A new hybrid classical-quantum algorithm for continuous global optimization problems
- Discretization vertex orders in distance geometry
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- New error measures and methods for realizing protein graphs from distance data
- Clifford algebra applied to Grover's algorithm
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Clifford algebra and the discretizable molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- The algebraic degree of geometric optimization problems
- Recent advances on the interval distance geometry problem
- Minimal NMR distance information for rigidity of protein graphs
- Oriented conformal geometric algebra and the molecular distance geometry problem
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- Tuning interval branch-and-prune for protein structure determination
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances
- On the optimality of finding DMDGP symmetries
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- Open research areas in distance geometry
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Implementation of efficient quantum search algorithms on NISQ computers
- Six mathematical gems from the history of distance geometry
- Molecular distance geometry methods: from continuous to discrete
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- An Introduction to Distance Geometry applied to Molecular Geometry
- A Geometric Algebra Invitation to Space-Time Physics, Robotics and Molecular Geometry
- A Primer on Quantum Computing
- Euclidean Distance Geometry
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- Computational Experience with the Molecular Distance Geometry Problem
- Quantum walks and search algorithms
