Amazon received approval Feb. 10 to deploy thousands more broadband satellites, weeks after seeking relief from a July milestone for its first-generation network after reaching only about 11% of the required deployment.
The post FCC approves thousands more Amazon Leo satellites as Gen 1 deadline looms appeared first on SpaceNews.
Manufacturers of small satellites that lack opportunities to build very large constellations say they are seeing growing interest from customers seeking smaller systems tailored to specific needs.
The post Satellite manufacturers see emerging market for ‘mini-constellations’ appeared first on SpaceNews.
“The NRO is always looking for innovative ways to bring on new partners,” said Chris Scolese, director of the NRO
The post National Reconnaissance Office adds HEO, SatVu and Sierra Nevada to commercial imaging program appeared first on SpaceNews.
Executives say customers care less about how data moves than what it enables
The post Laser-linked satellite networks moving from concept to capability appeared first on SpaceNews.
MOUNTAIN VIEW, Calif. – Australia is applying space-related products and services to national and regional challenges through an independent not-for-profit organization, the Australasian Space Innovation Institute (ASII). ASII, which began operations in January, builds on the work of the SmartSat Cooperative Research Centre, a consortium established in 2019 to bolster research and development of space […]
The post Australasia Space Innovation Institute applies space technologies to address terrestrial challenges appeared first on SpaceNews.
COO Mark Peller said ULA is aiming for between 18 and 22 launches in 2026
The post ULA seeks to rebuild launch cadence after CEO’s exit appeared first on SpaceNews.
MILAN — Bavarian Minister-President Markus Söder announced Feb. 4 that the German Aerospace Center (DLR) will receive 58 million euros ($69 million) to build a Human Exploration Control Center to support future robotic and human exploration missions. The total cost of the facility is 78 million euros and in addition to the Bavarian funding, DLR […]
The post Germany funds 78 million euro human exploration control center appeared first on SpaceNews.
Amazon announced its first LEO maritime broadband reseller agreements Feb. 10, as it prepares to deploy another batch of satellites this week on the inaugural flight of Europe’s Ariane 64 rocket.
The post Amazon Leo nets anchor maritime resellers appeared first on SpaceNews.
MOUNTAIN VIEW, Calif. – The Aerospace Corp. is sharing DiskSat technology with industry partners as the first four pancake-shaped spacecraft undergo commissioning. Orbotic Systems, a Southern California startup focused on space debris remediation, and San Francisco-based edge computing startup Satylt have signed the first DiskSat commercial licensing agreements. “This is an opportunity for commercial, international, […]
The post Aerospace attracts partners for DiskSat demonstrations appeared first on SpaceNews.
Non-venture investment in space startups surged last year to its highest level since a 2021 spike driven by a wave of special purpose acquisition company mergers, according to BryceTech analysis.
The post Non-venture space startup investment hits post-SPAC high appeared first on SpaceNews.
SAN FRANCISCO – Spaceium, a startup planning to establish a network of in-space refueling and repair stations, demonstrated the actuator for its robotic arm in space. Extensive testing of Spaceium’s actuator, which flew on Transporter-15, the SpaceX Falcon 9 rideshare launched in November, confirmed its accuracy.“We tested the actuator first, because our technology revolves […]
The post Spaceium demonstrates refueling actuator in orbit appeared first on SpaceNews.
A satellite to be built by Canadian startup Galaxia for launch in 2027 is being lined up for a study aimed at improving California-based Apolink’s proposed in-orbit data relay services.
The post Apolink and Galaxia team up to improve planned data relay capability appeared first on SpaceNews.
Entanglement is a key resource for quantum computation and quantum technologies, but it can also tell us much about a computational problem. That is the conclusion of a recent paper by Achim Kempf and Einar Gabbassov – who are applied mathematicians at Canada’s University of Waterloo and are affiliated with Waterloo’s Institute for Quantum Computing and the Perimeter Institute for Theoretical Physics. Writing in Quantum Science and Technology, Gabbassov and Kempf show how entanglement plays a fundamental role in determining both the efficiency and the hardness of quantum computation problems.
They considered the role of entanglement in adiabatic quantum computing. This considers a landscape of hills and valleys (the problem) where the shape of the landscape depends on the problem to be solved. A point on the landscape represents a candidate solution to the problem. This could be a configuration of possible states of three qubits, for example, or “a possible schedule for truck routes, or a particular shape for a pharmaceutical molecule” says Kempf. The actual solution to the problem is then the lowest (deepest) point in the landscape, which corresponds to the lowest energy point (the minimum point or minima).
This minima is easy to find if the landscape is smooth and has only one valley. The problem is harder if there are multiple valleys (a rugged landscape) since you might get stuck in a valley you believe to be the deepest, but which is not, and then you would have to climb out of it.
In a classical computation, every possible valley must be checked one-by-one to find the deepest one. However, Kempf explains that “in adiabatic quantum computing, the computer keeps track of all the valleys at once, by connecting them internally using entanglement”. Classically, many possibilities just means many independent guesses of the deepest valley. With quantum effects, when one part of the landscape shifts, it affects the whole landscape all at once. He explains that instead of checking each valley one-by-one, we can check them all simultaneously, significantly increasing the speed at which the lowest point in the landscape is found.
When given a difficult problem with many valleys, there is a risk of getting stuck in a valley that is shallow and not being able to climb out and find the lowest energy state. Adiabatic quantum computing gets around this issue through a clever shapeshifting of the landscape.
The process starts with an easy landscape, comprising only one valley. Since the solution is simple, the the deepest valley corresponding to the lowest energy state is occupied quickly. Gradually the landscape is changed to contain more and more valleys, more closely approximating the more complicated landscape whose lowest point is the solution.
The lowest point changes with each change in the landscape, but the trick is that if the changes in the landscape are small enough, the deepest part of the landscape and therefore the lowest energy state will always be occupied. This is the basic principle of adiabatic quantum computing often used in resource allocation, routing and logistics, and machine learning where there can be huge numbers of possible variable configurations.
In their work, Gabbassov and Kempf explore how the amount of entanglement required to find the deepest valley links to the difficulty and time needed to complete the problem.
A difficult problem would be a rugged landscape consisting of multiple valleys of similar depth located far apart from one another. To occupy the lowest energy state, we need to occupy all these valleys simultaneously. The entanglement needed to do this is greater since the interconnectedness between the valleys is harder to maintain when they are further apart (they have a large Hamming distance). The problem is also harder to solve since it is more difficult to discern which of these valleys is the deepest when they have a similar depth – being close in energy. This added difficulty is reflected in a need for a greater amount of entanglement to keep track of the valleys but also in a greater amount of time needed to distinguish the depths of the valleys to find the deepest one.
Gabbassov and Kempf show that a large amount of entanglement is needed at these difficult, bottleneck points of the computation. This makes it even more difficult to keep track of the valleys and more time is required to avoid falling into the wrong one. This is also where classical computation would normally slow down. Quantum effects are therefore most valuable and are most crucial at these points, proving essential for identifying when and where adiabatic quantum computation can provide a genuine advantage over classical methods.
Kempf summarizes this as, “the hardness of any computational problem, directly translates into the corresponding widespreadness of entanglement the quantum computer needs to keep track of all the valleys so that it can find the minimum point. Calculational hardness therefore means the need for sophisticated entanglement. Since entanglement is a precious and fragile resource, a hard problem that requires a lot of it can only be solved slowly.”
Entanglement therefore proves to be a useful tool not just for significantly increasing the computational speed of problems but also in characterizing problem difficulty and computation speed. As Gabbassov notes “if we want to devise faster quantum algorithms, we should look not just at the amount of entanglement but also at how this entanglement redistributes/flows” and therefore the structure of the problem. Their work shows that the amount of entanglement used as a resource is more subtle than just providing a general computational speed-up.
The post Entanglement reveals the difficulty of computational problems appeared first on Physics World.
Connexion