scholarly journals Asset–liability modelling in the quantum era

2021 ◽  
Vol 26 ◽  
Author(s):  
T. Berry ◽  
J. Sharpe
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
Capital Requirements ◽  
Quantum Computers ◽  
Investment Management ◽  
Asset Liability Management ◽  
Liability Management ◽  
Insight Into ◽  
Current Practices

Abstract This paper introduces and demonstrates the use of quantum computers for asset–liability management (ALM). A summary of historical and current practices in ALM used by actuaries is given showing how the challenges have previously been met. We give an insight into what ALM may be like in the immediate future demonstrating how quantum computers can be used for ALM. A quantum algorithm for optimising ALM calculations is presented and tested using a quantum computer. We conclude that the discovery of the strange world of quantum mechanics has the potential to create investment management efficiencies. This in turn may lead to lower capital requirements for shareholders and lower premiums and higher insured retirement incomes for policyholders.

LSI-BASED EFFICIENT EMULATION OVERCOMING ALGORITHMIC RESTRICTIONS INHERENT IN QUANTUM COMPUTERS

2003 ◽  
Vol 03 (04) ◽  
pp. C9-C17
Author(s):  
MINORU FUJISHIMA
Keyword(s):  
Periodic Function ◽  
Integrated Circuit ◽  
High Speed ◽  
Large Scale ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
Quantum Computers ◽  
Np Problems

Quantum computers are believed to perform high-speed calculations, compared with conventional computers. However, the quantum computer solves NP (non-deterministic polynomial) problems at a high speed only when a periodic function can be used in the process of calculation. To overcome the restrictions stemming from the quantum algorithm, we are studying the emulation by a LSI (large scale integrated circuit). In this report, first, it is explained why a periodic function is required for the algorithm of a quantum computer. Then, it is shown that the LSI emulator can solve NP problems at a high speed without using a periodic function.

scholarly journals Most Preferred Business Banking Product of HDFC Bank in Trichy City

2011 ◽  
Vol 2 (4) ◽  
pp. 177-185
Author(s):  
Uma Rani T.
Keyword(s):  
Risk Management ◽  
Constant Factor ◽  
Asset Liability Management ◽  
Liability Management ◽  
New Concepts ◽  
The World ◽  
The Face ◽  
The Impact ◽  
Insight Into ◽  
Rapid Transformation

Change is the only constant factor in this dynamic world and banking is not an exception. The changes staring in the face of bankers relates to the fundamental way of banking-which is undergoing rapid transformation in the world of today, in response to the forces of completion productivity and efficiency of operations, reduced operating margins better asset/liability management, risk management, any time and any where banking. The major challenge faced by banks today is to protect the falling margins due to the impact of competition. Another significant impact of banks today is the technology issue. In this study the business banking products of HDFC bank, that best suits the needs of the borrower were analysed. The Customer feels that loans to be obtained require a process that is extremely complicating and time consuming. This calls for an ombudsman setup separately for the domain. The observation and findings of the study have helped to give useful recommendation to bank. The implementation of the suggestion can help to improve strategies and build competencies over that of their competitors. This study has there by helped me by giving exposure into new concepts in today’s banking scenario as the interface shifts from service to products. There has also been some insight into competency recognition.

Hidden symmetry detection on a quantum computer

2007 ◽  
Vol 7 (1&2) ◽  
pp. 83-92
Author(s):  
R. Schutzhold ◽  
W.G. Unruh
Keyword(s):  
Quantum Computer ◽  
Quantum Algorithms ◽  
Quantum Algorithm ◽  
Quantum Computers ◽  
Self Similarity ◽  
Hidden Subgroup Problem ◽  
Hidden Symmetry ◽  
Speed Up ◽  
Subgroup Problem ◽  
Discrete Scale

The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved efficiently by quantum computers, it will be demonstrated by means of a simple example, that the detection of more general hidden (two-point) symmetries {$V\{f(x),f(U[x])\}=0$} by a quantum algorithm can also admit an exponential speed-up. E.g., one member of this class of symmetries {$V\{f(x),f(U[x])\}=0$} is discrete self-similarity (or discrete scale invariance).

scholarly journals Automated Quantum Hardware Selection for Quantum Workflows

Electronics ◽  
2021 ◽  
Vol 10 (8) ◽  
pp. 984
Author(s):  
Benjamin Weder ◽  
Johanna Barzen ◽  
Frank Leymann ◽  
Marie Salm
Keyword(s):  
Quantum Computer ◽  
Quantum Algorithm ◽  
Software Tool ◽  
Quantum Circuit ◽  
Quantum Circuits ◽  
Quantum Computers ◽  
Workflow Model ◽  
Selection For ◽  
Selection Of

The execution of a quantum algorithm typically requires various classical pre- and post-processing tasks. Hence, workflows are a promising means to orchestrate these tasks, benefiting from their reliability, robustness, and features, such as transactional processing. However, the implementations of the tasks may be very heterogeneous and they depend on the quantum hardware used to execute the quantum circuits of the algorithm. Additionally, today’s quantum computers are still restricted, which limits the size of the quantum circuits that can be executed. As the circuit size often depends on the input data of the algorithm, the selection of quantum hardware to execute a quantum circuit must be done at workflow runtime. However, modeling all possible alternative tasks would clutter the workflow model and require its adaptation whenever a new quantum computer or software tool is released. To overcome this problem, we introduce an approach to automatically select suitable quantum hardware for the execution of quantum circuits in workflows. Furthermore, it enables the dynamic adaptation of the workflows, depending on the selection at runtime based on reusable workflow fragments. We validate our approach with a prototypical implementation and a case study demonstrating the hardware selection for Simon’s algorithm.

scholarly journals ABOUT QUANTUM COMPUTER AND QUANTUM MEDICINE

2021 ◽  
Vol 20 (2) ◽  
pp. 18-24
Author(s):  
M.N. Borisevich ◽  
◽  
V.I. Kozlovsky ◽  
Keyword(s):  
Quantum Mechanics ◽  
Integrated Circuits ◽  
Quantum Physics ◽  
Quantum Computer ◽  
Foundations Of Quantum Mechanics ◽  
Quantum Computers ◽  
Short Report ◽  
Max Planck ◽  
Physical Experiments ◽  
Photo Effect

The foundations of quantum physics have been laid by Max Planck, who suggested that energy couldn’t be absorbed and radiated continuously, but only in separate portions - these portions were called quanta. His ideas were confirmed in numerous physical experiments on the photo effect, the structure of the atom and atomic nucleus, brilliantly performed by Bohr and Rutherford. All this in the aggregate made it possible to eliminate the border between matter and waves, predicted by Louis de Broil. In this way the foundations of quantum mechanics were laid = Heisenberg and Schrödinger did this work. Many manifestations of quantum physics can already be observed in everyday life. These are optical quantum generators, computer CDs, and integrated circuits and lots and lots of this. In recent years, the researchers have drawn their attention to other quantum physics applications related to queries. By their design, this work will be carried out in the future by quantum computers. The article presents a short report on the quantum computer and the prospects for its use in quantum medicine.

scholarly journals Introduction to Quantum Computing

2020 ◽  
Author(s):  
Surya Teja Marella ◽  
Hemanth Sai Kumar Parisa
Keyword(s):  
Quantum Computing ◽  
Cyber Security ◽  
Quantum Computer ◽  
General Purpose ◽  
Small Scale ◽  
Quantum Computers ◽  
Ongoing Research ◽  
Advantages And Disadvantages ◽  
Traffic Optimization ◽  
Insight Into

Quantum computing is a modern way of computing that is based on the science of quantum mechanics and its unbelievable phenomena. It is a beautiful combination of physics, mathematics, computer science and information theory. It provides high computational power, less energy consumption and exponential speed over classical computers by controlling the behavior of small physical objects i.e. microscopic particles like atoms, electrons, photons, etc. Here, we present an introduction to the fundamental concepts and some ideas of quantum computing. This paper starts with the origin of traditional computing and discusses all the improvements and transformations that have been done due to their limitations until now. Then it moves on to the basic working of quantum computing and the quantum properties it follows like superposition, entanglement and interference. To understand the full potentials and challenges of a practical quantum computer that can be launched commercially, the paper covers the architecture, hardware, software, design, types and algorithms that are specifically required by the quantum computers. It uncovers the capability of quantum computers that can impact our lives in various viewpoints like cyber security, traffic optimization, medicines, artificial intelligence and many more. At last, we concluded all the importance, advantages and disadvantages of quantum computers. Small-scale quantum computers are being developed recently. This development is heading towards a great future due to their high potential capabilities and advancements in ongoing research. Before focusing on the significances of a general-purpose quantum computer and exploring the power of the new arising technology, it is better to review the origin, potentials, and limitations of the existing traditional computing. This information helps us in understanding the possible challenges in developing exotic and competitive technology. It will also give us an insight into the ongoing progress in this field.

scholarly journals Programming gate-based hardware quantum computers for music

Muzikologija ◽  
2018 ◽  
pp. 21-37
Author(s):  
Alexis Kirke
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Computation ◽  
Computer Music ◽  
Quantum Computer ◽  
Quantum Computers ◽  
Future Contribution ◽  
Computer Algorithms ◽  
Quantum Processes ◽  
D Wave

There have been significant attempts previously to use the equations of quantum mechanics for generating sound, and to sonify simulated quantum processes. For new forms of computation to be utilized in computer music, eventually hardware must be utilized. This has rarely happened with quantum computer music. One reason for this is that it is currently not easy to get access to such hardware. A second is that the hardware available requires some understanding of quantum computing theory. This paper moves forward the process by utilizing two hardware quantum computation systems: IBMQASM v1.1 and a D-Wave 2X. It also introduces the ideas behind the gate-based IBM system, in a way hopefully more accessible to computerliterate readers. This is a presentation of the first hybrid quantum computer algorithm, involving two hardware machines. Although neither of these algorithms explicitly utilize the promised quantum speed-ups, they are a vital first step in introducing QC to the musical field. The article also introduces some key quantum computer algorithms and discusses their possible future contribution to computer music.

Quantum Computing Memoir: Quantum Mechanics, Architectural Developments and its Future

2021 ◽  
Vol 9 (8) ◽  
pp. 2198-2200
Author(s):  
Abhay Patil
Keyword(s):  
Quantum Mechanics ◽  
Quantum Computing ◽  
Quantum Theory ◽  
Computer Science ◽  
Physical Science ◽  
Quantum Computer ◽  
Energy Utilization ◽  
Quantum Computers ◽  
Edge Method ◽  
Limited Scope

Abstract: Quantum computing is a cutting edge method of computing that depends on the study of quantum mechanics and its staggering marvels. It is an excellent blend of physical science, arithmetic, computer science and data hypothesis. It gives high computational force, less energy utilization and remarkable speed over old-style computers by controlling the conduct of little actual articles for example minuscule particles like iotas, electrons, photons, and so forth Here, we present a prologue to the crucial ideas and a few thoughts of quantum computing. To comprehend the true abilities and difficulties of a pragmatic quantum computer that can be dispatched financially, the paper covers the engineering, equipment, programming, plan, types and calculations that are explicitly needed by quantum computers. It reveals the ability of quantum computers that can affect our lives in different perspectives like network safety, traffic enhancement, medications, man-made reasoning and some more. Limited scope quantum computers are being grown as of late. This improvement is going towards an incredible future because of their high possible abilities and headways in continuous exploration. Prior to zeroing in on the meanings of a broadly useful quantum computer and investigating the force of the new emerging innovation, it is smarter to survey the beginning, possibilities, and restrictions of the current conventional computing. This data helps us in understanding the potential difficulties in creating outlandish and serious innovation. It will likewise give us an understanding of the continuous advancement in this field. Keywords: Realtime Systems, Programming Processors, Quantum Theory, Quantum Computing

scholarly journals Unfolding quantum computer readout noise

2020 ◽  
Vol 6 (1) ◽  
Author(s):  
Benjamin Nachman ◽  
Miroslav Urbanek ◽  
Wibe A. de Jong ◽  
Christian W. Bauer
Keyword(s):  
Nuclear Physics ◽  
High Energy Physics ◽  
Quantum Computer ◽  
Quantum Algorithm ◽  
High Energy ◽  
Matrix Inversion ◽  
Quantum Computers ◽  
Statistical Fluctuations ◽  
Inversion Techniques ◽  
Energy Physics

Abstract In the current era of noisy intermediate-scale quantum computers, noisy qubits can result in biased results for early quantum algorithm applications. This is a significant challenge for interpreting results from quantum computer simulations for quantum chemistry, nuclear physics, high energy physics (HEP), and other emerging scientific applications. An important class of qubit errors are readout errors. The most basic method to correct readout errors is matrix inversion, using a response matrix built from simple operations to probe the rate of transitions from known initial quantum states to readout outcomes. One challenge with inverting matrices with large off-diagonal components is that the results are sensitive to statistical fluctuations. This challenge is familiar to HEP, where prior-independent regularized matrix inversion techniques (“unfolding”) have been developed for years to correct for acceptance and detector effects, when performing differential cross section measurements. We study one such method, known as iterative Bayesian unfolding, as a potential tool for correcting readout errors from universal gate-based quantum computers. This method is shown to avoid pathologies from commonly used matrix inversion and least squares methods.

Sign in / Sign up

Export Citation Format

Share Document