Evidence map›Paper›PMID 35009787›Full record

ArticleSensors (Basel, Switzerland)2021

Improvement of Quantum Approximate Optimization Algorithm for Max-Cut Problems.

Javier Villalba-Diez, Ana González-Marcos, Joaquín B Ordieres-Meré

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.

0numbers the graph read from it
0cells of the map it votes in
2citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

2 citing papers in PubMed.

  1. Article
  2. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Javier Villalba-DiezHochschule Heilbronn, Fakultät Management und Vertrieb, Campus Schwäbisch Hall, 74523 Schwäbisch Hall, Germany.ORCID 0000-0002-2423-1474
Ana González-MarcosDepartment of Mechanical Engineering, Universidad de La Rioja, San José de Calasanz 31, 26004 Logroño, Spain.ORCID 0000-0003-4684-659X
Joaquín B Ordieres-MeréEscuela Técnica Superior de Ingenieros Industriales (ETSII), Universidad Politécnica de Madrid, José Gutiérrez Abascal 2, 28006 Madrid, Spain.ORCID 0000-0002-9677-6764

Funding

Agencia Estatal de Investigación. RTI2018-094614-B-I0
6 · The paper itself

Abstract

The objective of this short letter is to study the optimal partitioning of value stream networks into two classes so that the number of connections between them is maximized. Such kind of problems are frequently found in the design of different systems such as communication network configuration, and industrial applications in which certain topological characteristics enhance value-stream network resilience. The main interest is to improve the Max-Cut algorithm proposed in the quantum approximate optimization approach (QAOA), looking to promote a more efficient implementation than those already published. A discussion regarding linked problems as well as further research questions are also reviewed.

Indexed as

AlgorithmsIndustry 4.0optimizationquantum approximate optimization algorithmvalue–stream networks

Identifiers

PMID35009787
PMCPMC8749604

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.