( en | de | ru )

 

Disambiguation of "Puertas, Antonio Manuel"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient design of a quantum absolute-value circuit using Clifford+T gates.

, , , , , and . J. Supercomput., 79 (11): 12656-12670 (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Manuel Antonio Sebastiao

Manuel António Paulo

Antonio Manuel Nunes Pereira

António Manuel Martins Neto

Manuel Antonio López Valdés

 

Other publications of authors with the same name

GPU Computing to Speed-Up the Resolution of Microrheology Models., , , and . ICA3PP, volume 10048 of Lecture Notes in Computer Science, page 457-466. Springer, (2016)Quantum Annealing to Solve the Unrelated Parallel Machine Scheduling Problem., , , and . PPAM (2), volume 13827 of Lecture Notes in Computer Science, page 165-176. Springer, (2022)Finite size effects in active microrheology in colloids., , , and . Comput. Phys. Commun., (2019)Efficient design of a quantum absolute-value circuit using Clifford+T gates., , , , , and . J. Supercomput., 79 (11): 12656-12670 (2023)Accelerating the problem of microrheology in colloidal systems on a GPU., , and . J. Supercomput., 73 (1): 370-383 (2017)A New Look on Financial Markets Co-Movement through Cooperative Dynamics in Many-Body Physics., , , , and . Entropy, 22 (9): 954 (2020)Quantum annealing solution for the unrelated parallel machine scheduling with priorities and delay of task switching on machines., , , and . Future Gener. Comput. Syst., (November 2023)Quantum algorithms to compute the neighbour list of N-body simulations., , , , , and . Quantum Inf. Process., 23 (2): 61 (February 2024)On solving the unrelated parallel machine scheduling problem: active microrheology as a case study., , , , and . J. Supercomput., 76 (11): 8494-8509 (2020)