scholarly journals Optimum Partition Parameter of Divide-And-Conquer Algorithm for Solving Closest-Pair Problem

2011 ◽  
Vol 3 (5) ◽  
pp. 211-219 ◽  
Author(s):  
Mohammad Zaidul Karim ◽  
Nargis Akter
Keyword(s):  
Divide And Conquer ◽  
Divide And Conquer Algorithm ◽  
Closest Pair ◽  
Optimum Partition

scholarly journals A divide-and-conquer algorithm for quantum state preparation

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Israel F. Araujo ◽  
Daniel K. Park ◽  
Francesco Petruccione ◽  
Adenilton J. da Silva
Keyword(s):  
Computational Cost ◽  
Quantum Circuit ◽  
Divide And Conquer ◽  
Computational Time ◽  
Quantum Computers ◽  
Dimensional Vector ◽  
Quantum Devices ◽  
Divide And Conquer Algorithm ◽  
Quantum State Preparation ◽  
Quantum Device

AbstractAdvantages in several fields of research and industry are expected with the rise of quantum computers. However, the computational cost to load classical data in quantum computers can impose restrictions on possible quantum speedups. Known algorithms to create arbitrary quantum states require quantum circuits with depth O(N) to load an N-dimensional vector. Here, we show that it is possible to load an N-dimensional vector with exponential time advantage using a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits. Results show that we can efficiently load data in quantum devices using a divide-and-conquer strategy to exchange computational time for space. We demonstrate a proof of concept on a real quantum device and present two applications for quantum machine learning. We expect that this new loading strategy allows the quantum speedup of tasks that require to load a significant volume of information to quantum devices.

Influence and Information Flow in Online Social Networks

2017 ◽  
Vol 9 (4) ◽  
pp. 1-17
Author(s):  
Afrand Agah ◽  
Mehran Asadi
Keyword(s):  
Social Networks ◽  
Online Social Networks ◽  
Large Data ◽  
Marketing Strategies ◽  
Large Data Sets ◽  
Divide And Conquer ◽  
Data Sets ◽  
Divide And Conquer Algorithm ◽  
Flow Of Information

This article introduces a new method to discover the role of influential people in online social networks and presents an algorithm that recognizes influential users to reach a target in the network, in order to provide a strategic advantage for organizations to direct the scope of their digital marketing strategies. Social links among friends play an important role in dictating their behavior in online social networks, these social links determine the flow of information in form of wall posts via shares, likes, re-tweets, mentions, etc., which determines the influence of a node. This article initially identities the correlated nodes in large data sets using customized divide-and-conquer algorithm and then measures the influence of each of these nodes using a linear function. Furthermore, the empirical results show that users who have the highest influence are those whose total number of friends are closer to the total number of friends of each node divided by the total number of nodes in the network.

Sign in / Sign up

Export Citation Format

Share Document