A5074527005- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Topic Modeling
- Natural Language Processing Techniques
- Advanced Text Analysis Techniques
- Quantum Mechanics and Applications
- Text and Document Classification Technologies
- Quantum-Dot Cellular Automata
- Stochastic Gradient Optimization Techniques
- Neural Networks and Reservoir Computing
- Web Data Mining and Analysis
- Physical Unclonable Functions (PUFs) and Hardware Security
- Advanced Memory and Neural Computing
- Software Engineering Research
- Data Mining Algorithms and Applications
- Stochastic processes and financial applications
- Service-Oriented Architecture and Web Services
- Academic integrity and plagiarism
- Machine Learning in Materials Science
- Algorithms and Data Compression
- Information Retrieval and Search Behavior
- Internet of Things and AI
- Authorship Attribution and Profiling
- Sentiment Analysis and Opinion Mining
- Organizational and Employee Performance
JPMorgan Chase & Co (United States)
2023-2025
PayPal (United States)
2023
Central University of Jharkhand
2023
University of Edinburgh
2019-2022
Indian Institute of Technology Hyderabad
2008-2020
Université Paris Cité
2017-2019
Centre National de la Recherche Scientifique
2017-2019
Sorbonne Université
2017-2019
Institut de Recherche en Informatique Fondamentale
2019
Délégation Paris 7
2017
The quantum approximate optimization algorithm (QAOA) is a leading candidate for solving problems on computers. However, the potential of QAOA to tackle classically intractable remains unclear. Here, we perform an extensive numerical investigation low autocorrelation binary sequences (LABS) problem, which even moderately sized instances. We noiseless simulations with up 40 qubits and observe that runtime fixed parameters scales better than branch-and-bound solvers, are state-of-the-art exact...
Variational quantum algorithms, a popular heuristic for near-term computers, utilize parameterized circuits which naturally express Lie groups. It has been postulated that many properties of variational algorithms can be understood by studying their corresponding groups, chief among them the presence vanishing gradients or barren plateaus, but theoretical derivation lacking. Using tools from representation theory compact we formulate plateaus whose observables lie in dynamical algebra,...
Decision trees are widely adopted machine learning models due to their simplicity and explainability. However, as training data size grows, standard methods become increasingly slow, scaling polynomially with the number of examples. In this work, we introduce Des-q, a novel quantum algorithm construct retrain decision for regression binary classification tasks. Assuming stream produces small, periodic increments new examples, Des-q significantly reduces tree retraining time. achieves...
Approximate combinatorial optimisation has emerged as one of the most promising application areas for quantum computers, particularly those in near term. In this work, we focus on approximate algorithm (QAOA) solving MaxCut problem. Specifically, address two problems QAOA, how to initialise algorithm, and subsequently train parameters find an optimal solution. For former, propose graph neural networks (GNNs) a warm-starting technique QAOA. We demonstrate that merging GNNs with QAOA can...
We introduce a variational quantum algorithm to solve unconstrained black box binary optimization problems, i.e., problems in which the objective function is given as box. This contrast typical setting of algorithms for where classical provided Quadratic Unconstrained Binary Optimization problem and mapped sum Pauli operators. Furthermore, we provide theoretical justification our method based on convergence guarantees imaginary time evolution. To investigate performance its potential...
Rydberg atom arrays are among the leading contenders for demonstration of quantum speedups. Motivated by recent experiments with up to 289 qubits [Ebadi et al., Science 376, 1209 (2022)], we study maximum-independent-set problem on unit-disk graphs a broader range classical solvers beyond scope original paper. We carry out extensive numerical studies and assess hardness, using both exact heuristic algorithms. find that quasiplanar instances Union-Jack-like connectivity can be solved...
In this paper we present an automatic Keyphrase extraction technique for English documents of scientific domain. The devised algorithm uses n-gram filtration technique, which filters sophisticated n-grams {1dnd4} along with their weight from the words input document. To develop have used (1) LZ78 data compression based (2) a simple refinement step, (3) A Pattern Filtration and, (4) term weighting scheme. scheme, introduced importance position sentence (where given phrase occurs first) in...
Abstract Finding a concrete use case for quantum computers in the near term is still an open question, with machine learning typically touted as one of first fields which will be impacted by technologies. In this work, we investigate and compare capabilities versus classical models task generative modelling learning. We real world financial dataset consisting correlated currency pairs two their ability to learn resulting distribution—a restricted Boltzmann machine, circuit Born machine....
Abstract Although quantum computers can perform a wide range of practically important tasks beyond the abilities classical 1,2 , realizing this potential remains challenge. An example is to use an untrusted remote device generate random bits that be certified contain certain amount entropy 3 . Certified randomness has many applications but impossible achieve solely by computation. Here we demonstrate generation certifiably using 56-qubit Quantinuum H2-1 trapped-ion computer accessed over...
Abstract In recent years, many computational tasks have been proposed as candidates for showing a quantum advantage, that is an advantage in the time needed to perform task using instead of classical machine. Nevertheless, practical demonstrations such remain particularly challenging because difficulty bringing together all necessary theoretical and experimental ingredients. Here, we show demonstration prover-verifier interactive setting, where consists verification NP-complete problem by...
We provide an example of a communication model and distributed task, for which there exists realistic quantum protocol that is asymptotically more efficient than any classical protocol, both in the information resources. For this, we extend recently proposed coherent state mapping protocols, study use fingerprints over multiple channels, show their role design estimating Euclidean distance two real vectors within constant factor.
Abstract Demonstrating a quantum advantage with currently available experimental systems is of utmost importance in information science. While this remains elusive for computation, the field communication complexity offers possibility to already explore and showcase useful tasks. Here, we define such task, Sampling Matching problem, which inspired by Hidden problem features an exponential gap between classical protocols one-way model. Our allows its conception photonic implementation based...
We introduce a private quantum money scheme with the note verification procedure based on Sampling Matching, problem in one-way communication complexity model introduced by Kumar et al.[Nature Communications 10, Article number: 4152]. Our involves Bank that produces and distributes notes, noteholders who are untrusted trusted local verifiers of to whom holders send their notes order carry out transactions. The key aspects our include: requiring single round classical interaction between...
Cryptanalysis of quantum cryptographic systems generally involves finding optimal adversarial attack strategies on the underlying protocols. The core principle modeling attacks often reduces to ability adversary clone unknown states and extract thereby meaningful secret information. Explicit typically require high computational resources due large circuit depths or, in many cases, are unknown. Here we introduce variational cloning (VarQlone), a cryptanalysis algorithm based machine learning,...
Quantum physical unclonable functions, or QPUFs, are rapidly emerging as theoretical hardware solutions to provide secure cryptographic functionalities such key-exchange, message authentication, entity identification among others. Recent works have shown that in order provable security of these against any quantum polynomial time adversary, QPUFs required be a unitary sampled uniformly randomly from the Haar measure. This however is known require an exponential amount resources. In this...
Wide usage of social media platforms has increased the risk aggression, which results in mental stress and affects lives people negatively like psychological agony, fighting behavior, disrespect to others. Majority such conversations contains code-mixed languages[28]. Additionally, way used express thought or communication style also changes from one platform another (e.g., styles are different twitter Facebook). These all have complexity problem. To solve these problems, we introduced a...
In this paper, we present a novel N-gram (N> = 1) filtration technique for keyphrase extraction. To filter the sophisticated candidate keyphrases (N-grams), introduce combined use of: statistical feature (obtained by using weighted betweenness centrality scores of words, which is generally used to identify border nodes/edges in community detection techniques); 2) co-location strength (calculated nearest neighbour Dbpedia texts). We also graph, reduces bias effect lower length N-grams ranking...