4.2 Article

Quantum encoding of dynamic directed graphs

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Multidisciplinary Sciences

Quantum walk processes in quantum devices

Anandu Kalleri Madhu et al.

Summary: Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices are a hot topic at the border of current physical and information sciences. Quantum walk processes play a key role in many quantum algorithms and are computationally challenging for classical processors. This study explores the relationship between quantum walk on graphs and quantum circuits to pave the way for efficient quantum walk algorithms implementation on quantum computers.

HELIYON (2023)

Article Computer Science, Information Systems

Proportional lumpability and proportional bisimilarity

Andrea Marin et al.

Summary: This paper discusses the lumpability approach to address the state space explosion problem in computing the stationary performance indices of large stochastic models. The method is based on state aggregation technique and applies to Markov chains with structural regularity. A new concept of proportional lumpability is introduced, which extends the original definition and allows for exact computation of stationary performance indices. Additionally, proportional bisimilarity for PEPA terms is introduced, inducing lumpability on continuous-time Markov chains and showing compositional results and examples of applicability.

ACTA INFORMATICA (2022)

Article Computer Science, Theory & Methods

Revisiting Deutsch-Jozsa algorithm

Daowen Qiu et al.

INFORMATION AND COMPUTATION (2020)

Review Computer Science, Artificial Intelligence

Random Walks: A Review of Algorithms and Applications

Feng Xia et al.

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE (2020)

Article Physics, Multidisciplinary

Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity

Giorgia Minello et al.

ENTROPY (2019)

Article Computer Science, Theory & Methods

Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses

Giacomo Alzetta et al.

INFORMATION AND COMPUTATION (2018)

Article Computer Science, Software Engineering

Parameterized Complexity of Eulerian Deletion Problems

Marek Cygan et al.

ALGORITHMICA (2014)

Review Quantum Science & Technology

Quantum walks: a comprehensive review

Salvador Elias Venegas-Andraca

QUANTUM INFORMATION PROCESSING (2012)

Article Multidisciplinary Sciences

Google in a Quantum Network

G. D. Paparo et al.

SCIENTIFIC REPORTS (2012)

Article Computer Science, Hardware & Architecture

Computing with highly mixed states

Andris Ambainis et al.

JOURNAL OF THE ACM (2006)

Article Mathematics, Applied

Laplacians and the Cheeger inequality for directed graphs

Fan Chung

ANNALS OF COMBINATORICS (2005)

Article Computer Science, Theory & Methods

Quantum computing without entanglement

E Biham et al.

THEORETICAL COMPUTER SCIENCE (2004)

Article Multidisciplinary Sciences

On the role of entanglement in quantum-computational speed-up

R Jozsa et al.

PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES (2003)

Article Mathematics, Applied

On the digraph of a unitary matrix

S Severini

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS (2003)