Sentient creatures on Earth are familiar with the mostly undisputed history of the galaxy as documented in the Star Wars series by renowned galactic-historian George Lucas. After years of evil, authoritarian rule by the oppressive Emperor Palpatine, a rebel uprising spread across the galaxy, culminating in the legendary…
QRA Corp Begins Lockheed Martin Aeronautics Project to Deliver a New Generation of Systems Verification Solutions
QRA Corp has initiated work to provide Lockheed Martin engineers with an advanced early-stage systems verification solution for the proactive development of increasingly complex cyber-physical designs.
QRA Corp Welcomes Tech Industry Veteran David Lizius to Help Solve One of the Greatest Hurdles for Innovation
QRA is pleased to announce that Tech Industry Veteran David Lizius is joining the board.
Computing, cryptography, and information are some of the hottest buzzwords being appended to the term “quantum” these days, and companies such as QRA have one more to add to the list: “ready”. These terms are all rightfully met with an increased level of scrutiny, as the words themselves are so often breathless terms. So what does QRA mean when it says it is “Quantum Ready”? And where is Quantum Computing Technology headed within the systems engineering industry?
QRA will be presenting at the 2015 Atlantic Venture Forum June 11th. President and CEO, Jordan Kyriakidis will tell QRA’s unique story, describe some amazing recent achievements, and present a new sneak peak demonstration of QRA’s Critical Check Verification Tool. During our demonstration we’ll show how QRA can help engineers avoid late-stage testing catastrophes, while reducing time and cost in early stages of development. Below are some of the topics we’re going to talk about, so make sure you subscribe to our email newsletter and be the first to hear about upcoming news and events!
QRA is pleased to announce that one of its core development team, Douglas Staple, has set the world record for computing the prime counting function. The prime counting function is usually denoted by π(x), and counts the number of primes less-than or equal to x. Previously, the largest x for which π(x) was known was x = 1025: Dr. Staple calculated π(x) for x = 1026.