Paul Baird
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Paul Baird has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- John Carter Wood
School of Mathematics, University of Leeds, Leeds, UK
5 shared publications - Ali Fardoun
Département de Mathématiques, Université de Bretagne Occidentale, Brest Cedex, France
4 shared publications - Mohammad Wehbe
Université de Brest , Laboratoire de Mathématiques de Bretagne Atlantique UMR 6205, CS 93837, 29238 Brest Cedex, France
4 shared publications - Gilles Burel
Member, IEEE, LEST - UMR CNRS 6165, Université de Bretagne Occidentale, CS 93837, 29238 Brest cedex 3, France
3 shared publications - Hugo Pillin
Lab-STICC, University of Brest, Brest, France
3 shared publications - Roland Gautier
Univ Brest, CNRS, Lab-STICC, CS 93837, 6 Avenue Le Gorgeu, CEDEX 3, 29238 Brest, France
3 shared publications
Latest Publications
- Open Access
Hypercube Quantum Search: Exact Computation of the Probability of Success in Polynomial Time
In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success of quantum walks in the field, it is logical to study quantum search variants over several kind of walks. In this paper, we propose an in-depth study of the quantum search over a hypercube layout. First, through the analysis of elementary walk operators restricted to suitable eigenspaces, we show that the acting component of the search algorithm takes place in a small subspace of the Hilbert workspace that grows linearly with the problem size. Subsequently, we exploit this property to predict the exact evolution of the probability of success of the quantum search in polynomial time.
Open AccessHypercube Quantum Search: Exact Computation of the Probability of Success in Polynomial Time
In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success of quantum walks in the field, it is logical to study quantum search variants over several kind of walks. In this paper, we propose an in-depth study of the quantum search over a hypercube layout. First, through the analysis of elementary walk operators restricted to suitable eigenspaces, we show that the acting component of the search algorithm takes place in a small subspace of the Hilbert workspace that grows linearly with the problem size. Subsequently, we exploit this property to predict the exact evolution of the probability of success of the quantum search in polynomial time.
- Open Access
- 15 March 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (3) , 1-46
Hypercube quantum search: exact computation of the probability of success in polynomial time
In the emerging domain of quantum algorithms, Grover’s quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success of quantum walks in the field, it is logical to study quantum search variants over several kinds of walks. In this paper, we propose an in-depth study of the quantum search over a hypercube layout. First, through the analysis of elementary walk operators restricted to suitable eigenspaces, we show that the acting component of the search algorithm takes place in a small subspace of the Hilbert workspace that grows linearly with the problem size. Subsequently, we exploit this property to predict the exact evolution of the probability of success of the quantum search in polynomial time.
- 15 March 2023
- Published by Springer Nature in Quantum Information Processing
- Vol. 22 (3) , 1-46
Open AccessHypercube quantum search: exact computation of the probability of success in polynomial time
In the emerging domain of quantum algorithms, Grover’s quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success of quantum walks in the field, it is logical to study quantum search variants over several kinds of walks. In this paper, we propose an in-depth study of the quantum search over a hypercube layout. First, through the analysis of elementary walk operators restricted to suitable eigenspaces, we show that the acting component of the search algorithm takes place in a small subspace of the Hilbert workspace that grows linearly with the problem size. Subsequently, we exploit this property to predict the exact evolution of the probability of success of the quantum search in polynomial time.
- Open Access
- 2 April 2022
- Published by IntechOpen
Joint EigenValue Decomposition for Quantum Information Theory and Processing
The interest in quantum information processing has given rise to the development of programming languages and tools that facilitate the design and simulation of quantum circuits. However, since the quantum theory is fundamentally based on linear algebra, these high-level languages partially hide the underlying structure of quantum systems. We show that in certain cases of practical interest, keeping a handle on the matrix representation of the quantum systems is a fruitful approach because it allows the use of powerful tools of linear algebra to better understand their behavior and to better implement simulation programs. We especially focus on the Joint EigenValue Decomposition (JEVD). After giving a theoretical description of this method, which aims at finding a common basis of eigenvectors of a set of matrices, we show how it can easily be implemented on a Matrix-oriented programming language, such as Matlab (or, equivalently, Octave). Then, through two examples taken from the quantum information domain (quantum search based on a quantum walk and quantum coding), we show that JEVD is a powerful tool both for elaborating new theoretical developments and for simulation.
- 2 April 2022
- Published by IntechOpen
Open AccessJoint EigenValue Decomposition for Quantum Information Theory and Processing
The interest in quantum information processing has given rise to the development of programming languages and tools that facilitate the design and simulation of quantum circuits. However, since the quantum theory is fundamentally based on linear algebra, these high-level languages partially hide the underlying structure of quantum systems. We show that in certain cases of practical interest, keeping a handle on the matrix representation of the quantum systems is a fruitful approach because it allows the use of powerful tools of linear algebra to better understand their behavior and to better implement simulation programs. We especially focus on the Joint EigenValue Decomposition (JEVD). After giving a theoretical description of this method, which aims at finding a common basis of eigenvectors of a set of matrices, we show how it can easily be implemented on a Matrix-oriented programming language, such as Matlab (or, equivalently, Octave). Then, through two examples taken from the quantum information domain (quantum search based on a quantum walk and quantum coding), we show that JEVD is a powerful tool both for elaborating new theoretical developments and for simulation.
- 14 March 2022
- Published by Elsevier in Journal of Geometry and Physics
- Vol. 176
Heat flow for harmonic maps from graphs into Riemannian manifolds
- 14 March 2022
- Published by Elsevier in Journal of Geometry and Physics
- Vol. 176
Heat flow for harmonic maps from graphs into Riemannian manifolds
- 6 August 2020
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 193 (2) , 195-232
Quadratic cyclic sequences
- 6 August 2020
- Published by Springer Nature in Monatshefte für Mathematik
- Vol. 193 (2) , 195-232
Quadratic cyclic sequences
- Open Access
Quadratic Cyclic Sequences
We explore relations between cyclic sequences determined by a quadratic difference relation, cyclotomic polynomials, Eulerian digraphs and walks in the plane. These walks correspond to closed paths for which at each step one must turn either left or right through a fixed angle. In the case when this angle is $2 \pi /n$, then non-symmetric phenomena occurs for $n\geq 12$. Examples arise from algebraic numbers of modulus one which are not $n$'th roots of unity.Open AccessQuadratic Cyclic Sequences
We explore relations between cyclic sequences determined by a quadratic difference relation, cyclotomic polynomials, Eulerian digraphs and walks in the plane. These walks correspond to closed paths for which at each step one must turn either left or right through a fixed angle. In the case when this angle is $2 \pi /n$, then non-symmetric phenomena occurs for $n\geq 12$. Examples arise from algebraic numbers of modulus one which are not $n$'th roots of unity. - 21 June 2019
- Published by Walter de Gruyter GmbH in Advances in Geometry
- Vol. 19 (3) , 421-432
A class of analytic pairs of conjugate functions in dimension three
We exploit an ansatz in order to construct power series expansions for pairs of conjugate functions defined on domains of Euclidean 3-space. Convergence properties of the resulting series are investigated. Entire solutions which are not harmonic are found as well as a 2-parameter family of examples which contains the Hopf map.
- 21 June 2019
- Published by Walter de Gruyter GmbH in Advances in Geometry
- Vol. 19 (3) , 421-432
A class of analytic pairs of conjugate functions in dimension three
We exploit an ansatz in order to construct power series expansions for pairs of conjugate functions defined on domains of Euclidean 3-space. Convergence properties of the resulting series are investigated. Entire solutions which are not harmonic are found as well as a 2-parameter family of examples which contains the Hopf map.
- 13 July 2018
- Published by Elsevier in Differential Geometry and its Applications
- Vol. 60, 190-201
An integral formula for a class of biharmonic maps from Euclidean 3-space
- 13 July 2018
- Published by Elsevier in Differential Geometry and its Applications
- Vol. 60, 190-201
An integral formula for a class of biharmonic maps from Euclidean 3-space
- 28 February 2018
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 28 (4) , 3892-3905
Biharmonic Conformal Maps in Dimension Four and Equations of Yamabe-Type
- 28 February 2018
- Published by Springer Nature in The Journal of Geometric Analysis
- Vol. 28 (4) , 3892-3905
Biharmonic Conformal Maps in Dimension Four and Equations of Yamabe-Type
- 5 October 2017
- Published by Springer Nature in Lecture Notes in Mathematics
- p. 211-258
The Geometric Spectrum of a Graph and Associated Curvatures
- 5 October 2017
- Published by Springer Nature in Lecture Notes in Mathematics
- p. 211-258
The Geometric Spectrum of a Graph and Associated Curvatures